#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double , ll> Ps;
typedef pair<ll, bool> Pb;

const ll INF = 1e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
//↓,→,↑,←

/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= mod; b >>= 1;}(x *= a) %= mod; b--;} return x;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/
struct Timer {
    int64_t start;
    const int64_t CYCLES_PER_SEC = 2800000000;
    Timer() { reset(); }
    void reset() { start = getCycle(); }
    inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
    inline int64_t getCycle() {
        uint32_t low, high;
        __asm__ volatile ("rdtsc" : "=a" (low), "=d" (high));
        return ((int64_t)low) | ((int64_t)high << 32);
    }
};

Timer timer;

bool multicase = true;

ll n, m, k, w, num, a, b, c, d, e, h, q, ans, sum, l, r;

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

ll x[500005], y[500005], z[500005];
ll dp[500005];

vector<P> cons[2];
vec v[2];

void precalc(ll id) {
    // i = 0 or 1
    ll initn = n;
    if (id == 0) {
        while (pql.size())pql.pop();
        pql.push(-INF);
        ll n = cons[id].size();
        ll idx = 0;
        for (int i = initn; i >= 1; i--) {
            if (idx != n) {
                while (cons[id][idx].first == i) {
                    pql.push(cons[id][idx].second);
                    idx ++;
                    if (idx == n) break;
                }
            }
            ll value = pql.top(); pql.pop();
            if (value != -INF) {
                v[id].pb(value);
            } else {
                pql.push(-INF);
                continue;
            }
        }
    } else {
        while (pql.size())pql.pop();
        pql.push(-INF);
        ll n = cons[id].size();
        ll idx = 0;
        for (int i = 1; i <= initn; i++) {
            if (idx != n) {
                while (cons[id][idx].first == i) {
                    pql.push(cons[id][idx].second);
                    idx ++;
                    if (idx == n) break;
                }
            }
            ll value = pql.top(); pql.pop();
            if (value != -INF) {
                v[id].pb(value);
            } else {
                pql.push(-INF);
                continue;
            }
        }
    }
    while(v[id].size() < initn)v[id].pb(0);
    return;
}

void solve() {
    cin >> n;
    ll sum = 0;
    cons[0].clear();
    cons[1].clear();
    for (int i = 0; i < n; i++) {
        cin >> k >> l >> r;
        if (l < r) {
            // 右っ側による
            cons[1].pb(P(k + 1, r - l));
        } else {
            cons[0].pb(P(k, l - r));
        }
        sum += min(l, r);
    }
    for (int i = 0; i < 2; i++) {
        // v にはカイの候補を入れておく
        v[i].clear();
        sort(cons[i].begin(), cons[i].end());
        if (i == 0) reverse(cons[i].begin(), cons[i].end());
        precalc(i);
        sort(v[i].begin(), v[i].end());
        reverse(v[i].begin(), v[i].end());
        for (int j = 1; j < v[i].size(); j++) {
            v[i][j] += v[i][j - 1];
        }
        v[i].pb(0);
        sort(v[i].begin(), v[i].end());
    }
    ll ans = -INF;
    for (int i = 0; i <= n; i++) {
        int j = n - i;
        ans = max(v[0][i] + v[1][j], ans);
    }

    p(ans + sum);




    return;
}

int main() {
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}



Measured memory_bytes: 11832