#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<class T> ostream& operator << (ostream& os, const set<T>& s) { for (auto e : s) os << e << " "; return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { (a += b % mod) %= mod; if (a < 0) a += mod; }
template<class T> void operator += (vector<T>& v, vector<T> v2) { rep(i, sz(v2)) v.eb(v2[i]); }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12); // debuged
  int T;
  cin >> T;
  while (T--) solve();
}

// https://kmjp.hatenablog.jp/entry/2020/07/12/0900
void solve() {
  int n;
  cin >> n;

  priority_queue<pii> q[2];
  ll ans = 0;
  rep(i, n) {
    int k, l, r;
    cin >> k >> l >> r;
    k--;
    if (l >= r) {
      q[0].emplace(l - r, k);
      ans += r;
    } else {
      q[1].emplace(r - l, k); // q[0]と同じように扱いたい
      ans += l;
    }
  }

  {
    int sz_ = sz(q[0]);
    set<int> s;
    rep(i, sz_) s.emplace(i);
    rep(i, sz_) {
      int x, k;
      tie(x, k) = q[0].top();
      q[0].pop();

      auto it = s.upper_bound(k);
      // cerr << *it << "  " << s << endl;
      if (it == s.begin()) continue;
      ans += x;
      // cerr << k << " " << x << " " << *(--it) << endl; ++it;
      s.erase(*(--it));
    }
  }

  {
    int sz_ = sz(q[1]);
    set<int> s;
    for (int i = n - sz(q[1]); i < n; ++i) s.emplace(i);
    rep(i, sz_) {
      int x, k;
      tie(x, k) = q[1].top();
      q[1].pop();

      auto it = s.upper_bound(k);
      // cerr << *it << "  " << s << endl;
      if (it == s.end()) continue;
      ans += x;
      // cerr << k << " " << x << " " << *(--it) << endl; ++it;
      s.erase(*it);
    }
  }

  cout << ans << endl;
}


Measured memory_bytes: 9636