#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<double> Complex;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
    for (int i = 0; i < sz(v); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << " ";
    }
    return os;
}
int main() {
    int tt;
    cin >> tt;
    while (tt--) {
        int n;
        cin >> n;
        using T = tuple<int, ll, ll>;
        vector<T> v(n);
        rep(i, n) {
            int k;
            ll l, r;
            cin >> k >> l >> r;
            k--;
            v[i] = T(k, l, r);
        }
        auto f = [](T a, T b) {
            auto [ka, la, ra] = a;
            auto [kb, lb, rb] = b;
            if (la > ra && lb > rb) {
                if (ka != kb) {
                    return ka < kb;
                }
                return la - ra < lb - rb;
            }
            if (la < ra && lb < rb) {
                if (ka != kb) {
                    return ka > kb;
                }
                return la - ra > lb - rb;
            }
            return la - ra > lb - rb;
        };
        sort(all(v), f);
        ll ans = 0;
        rep(i, n) {
            auto [k, l, r] = v[i];
            // cout << i << " " << k << " " << l << " " << r << endl;
            if (i <= k)
                ans += l;
            else
                ans += r;
        }
        cout << ans << endl;
    }
}