#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
long long po(long a, long b){
    if(b==0){
        return 1;
    }
    
    long long z = po(a,b/2);
    z = mod(z*z);
    if(b%2!=0){
        z = mod(a*z);
    }
    return z;
}
 
bool prime_(int n){
  if(n==1){
    return false;
  }else if(n==2){
    return true;
  }else{
    for(int i=2;i<=std::sqrt(n);i++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}
 
long long gcd_(long long a, long long b){
  if(a<b){
    std::swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd_(b,a%b);
  }
}
 
long long lcm_(long long x, long long y){
  return (x/gcd_(x,y))*y;
}
 
//using namespace std;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;

long long calc(vector<pair<int, long long>> p){
  int n = p.size();
  REP(i, n) p[i].first = min(p[i].first, n);
  vector<vector<long long>> table(n + 1);
  REP(i, n) table[p[i].first].push_back(p[i].second);
  long long res = 0;
  priority_queue<long long> q;
  for(int d = n; d = 1; d--){
    for(long long v: table[d]) q.push(v);
    if(q.empty()) continue;
    long long v = q.top();
    q.pop();
    res += v;
  }
  return res;
}
void solve(int n, vector<int> k, vector<long long> l, vector<long long> r){
  vector<pair<int, long long>> pl, pr;
  long long ans = 0;
  REP(i, n){
    if(l[i] >= r[i]){
      ans += r[i];
      pl.push_back(make_pair(k[i], l[i] - r[i]));
    }else{
      ans += l[i];
      pr.push_back(make_pair(n - k[i], r[i] - l[i]));
    }
  }
  ans += calc(pl);
  ans += calc(pr);
  cout << ans << endl;
  return;
}
      
int main(){
  using namespace std;
  int t;
  cin>>t;
  REP(_, t){
    int n;
    cin>>n;
    vector<int> k[n];
    vector<long long> l[n], r[n];
    REP(i, n) cin>>k[i]>>l[i]>>r[i];
    solve(n, k, l, r);
  }
  return 0;
}
