/*input 
3
2
1 5 10
2 15 5
3
3 1 1
3 1 2
3 3 3
19
19 23 16
5 90 13
12 85 70
19 67 78
12 16 60
18 48 28
5 4 24
12 97 97
4 57 87
19 91 74
18 100 76
7 86 46
9 100 57
3 76 73
6 84 93
1 6 84
11 75 94
19 15 3
12 11 34
*/ 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=3e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e16;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
pair<int,pii> arr[maxn];
bool cmp(pair<int,pii> &a,pair<int,pii> &b){
    return abs(a.s.f-a.s.s)>abs(b.s.f-b.s.s);
}
void solve(){
    int n;
    cin>>n;
    set<int> s;
    ll ans=0;
    vector<pair<int,pii>> arr;
    REP(i,n){
        s.insert(i);
        pair<int,pii> x;
        cin>>x.f>>x.s.f>>x.s.s;
        if(x.s.f==x.s.s){
            ans+=x.s.f;
            continue;
        }
        if(x.f==n){
            ans+=x.s.f;
            continue;
        }
        --x.f;
        arr.pb(x);
    }
    sort(ALL(arr),cmp);
    REP(i,sz(arr)){
        if(arr[i].s.f>arr[i].s.s){
            if(s.upper_bound(arr[i].f)==s.begin()){
                ans+=arr[i].s.s;
                continue;
            }
            s.erase(prev(s.upper_bound(arr[i].f)));
            ans+=arr[i].s.f;
        }
        else{
            if(s.upper_bound(arr[i].f)==s.end()){
                ans+=arr[i].s.f;
                continue;
            }
            s.erase((s.upper_bound(arr[i].f)));
            ans+=arr[i].s.s;
        }
    }
    cout<<ans<<'\n';
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int t;
    cin>>t;
    while(t--) solve();
}
