#include<bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

class Link {
public:
    Link(li n) : left(n), right(n), filled(n, false) {
        // left[0] = -1, right[n-1] = n
        rin{
            left[i] = i - 1;
            right[i] = i + 1;
        }
    }

    //
    li Fill(li pos, bool dir_right) {
        if (pos < 0 || pos >= sz(filled)) {
            return pos;
        }
        if (!filled[pos]) {
            filled[pos] = true;
            if (right[pos] < sz(filled)) {
                left[right[pos]] = left[pos];
            }
            if (left[pos] >= 0) {
                right[left[pos]] = right[pos];
            }
            /*
            if (right[pos] < sz(filled)) {
                right[pos] = right[right[pos]];
            }
            if (left[pos] >= 0) {
                left[pos] = left[left[pos]];
            }
            */
            return pos;
        } else {
            if (dir_right) {
                auto res = Fill(right[pos], dir_right);
                if (res < sz(filled)) {
                    right[pos] = right[res];
                }
                return res;
            } else {
                auto res = Fill(left[pos], dir_right);
                if (res >= 0) {
                    left[pos] = left[res];
                }
                return res;
            }
        }
    }

    vector<li> left;
    vector<li> right;
    vector<bool> filled;
};

inline void solve() {
    li n;
    li base = 0;
    cin >> n;

    // {diff, k, dir}
    vector<pair<li, PI>> v;

    rin{
        li k, l, r;
        cin >> k >> l >> r;
        k--;
        base += min(l, r);
        li diff = abs(l - r);
        if (l > r) {
            // 左に寄せたい
            v.pb({diff, {k, 0}});
        } else{
            v.pb({diff, {k + 1, 1}});
        }
    }
    sort(allof(v));
    reverse(allof(v));
    Link link_left(n);
    Link link_right(n);
    li res = base;
    rin{
        if (v[i].S.S) {
            auto pos = link_right.Fill(v[i].S.F, v[i].S.S);
            if (pos >= 0 && pos < n) {
                res += v[i].F;
            }
        } else {
            auto pos = link_left.Fill(v[i].S.F, v[i].S.S);
            if (pos >= 0 && pos < n) {
                res += v[i].F;
            }
        }
    }
    cout << res << endl;
}

int main() {
    li t;
    cin >> t;
    rep(i, t) {
        solve();
    }


    return 0;
}

Measured memory_bytes: 14216