#include <bits/stdc++.h>
const long long INF = 1LL << 60;
using namespace std;
template <class T = int>
T in() {
  T x;
  cin >> x;
  return (x);
}
template <class T>
void print(T& x) {
  cout << x << '\n';
}
const int MOD = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMint() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long gcd(long long a, long long b) {
  if (a < 0) a = -a;
  if (b < 0) b = -b;
  if (b == 0) return a;
  if (a > b) {
    swap(a, b);
  }
  return gcd(a, b % a);
}
long long lcm(long long a, long long b) {
  if (a < 0) a = -a;
  if (b < 0) b = -b;
  long long g;
  g = gcd(a, b);
  return b / g * a;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
  if (a.second != b.second) {
    return a.second < b.second;
  } else {
    return a.first < b.first;
  }
}
bool compare_by_a(pair<int, int> a, pair<int, int> b) {
  if (a.first != b.first) {
    return a.first < b.first;
  } else {
    return a.second < b.second;
  }
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
long long RS(long long N, long long pair<int, int>, long long m) {
  if (pair<int, int> == 0) {
    return 1;
  } else {
    if (pair<int, int> % 2 == 0) {
      long long t = RS(N, pair<int, int> / 2, m);
      return t * t % m;
    } else {
      return N * RS(N, pair<int, int> - 1, m) % m;
    }
  }
}
long long f(vector<pair<long long, long long>> p) {
  if (p.size() == 0) {
    return 0;
  }
  long long ret = 0;
  sort(p.begin(), p.end());
  int N = p.size();
  long long now = p[0].first;
  priority_queue<long long> q;
  for (int i = 0; i < (N); ++i) {
    if (p[i].first != now) {
      long long s = q.size();
      while (s > now) {
        ret -= q.top();
        q.pop();
        s--;
      }
      now = p[i].first;
    }
    ret += p[i].second;
    q.push(p[i].second);
  }
  long long s = q.size();
  while (s > now) {
    ret -= q.top();
    q.pop();
    s--;
  }
  return ret;
}
long long solve() {
  long long N;
  cin >> N;
  vector<pair<long long, long long>> s;
  vector<pair<long long, long long>> t;
  long long k, l, r;
  long long ans = 0;
  for (int i = 0; i < (N); ++i) {
    cin >> k >> l >> r;
    ans += min(l, r);
    if (l > r) {
      s.emplace_back(k, l - r);
    } else {
      t.emplace_back(N - k, r - l);
    }
  }
  cout << ans + f(s) + f(t) << endl;
}
int main() {
  ios::sync_with_stdio(false);
  int T = in();
  while (T--) solve();
  return 0;
}
