#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;

ll f(vector<P> p){
    int n = p.size();
    rep(i, n) p[i].first = min(p[i].first, n);
    vector<vector<int>> s(n+1);
    rep(i, n) s[p[i].first].push_back(p[i].second);

    ll res = 0;
    priority_queue<int> q;
    for(int i = n; i >= 1; i--){
        for(int x : s[i]) q.push(x);
        if(q.size() > 0){
            res += q.top();
            q.pop();
        }
    }
    return res;
}

void solve(){
    int n;
    cin >> n;
    vector<P> pl, pr;
    ll ans = 0;
    rep(i, n){
        int k, l, r;
        cin >> k >> l >> r;
        int m = min(l, r);
        l -= m; r -= m;
        ans += m;
        if(l > 0) pl.emplace_back(k, l);
        else pr.emplace_back(n-k, r);
    }
    ans += f(pl);
    ans += f(pr);
    cout << ans << endl;
}

int main(){
    int ts;
    cin >> ts;
    rep(ti, ts) solve();
    return 0;
}