#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 62;
int iinf = 1 << 30;
double pi = 3.14159265358979323846;
double pi2 = pi / 2.0;
double eps = 1e-8;
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (a < 0) a = -a;
  if (b < 0) b = -b;
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  if (k < 0) return 0;
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long popcount(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  for (long long _ = 0; _ < t; _++) {
    long long n;
    cin >> n;
    long long k[n], l[n], r[n];
    vector<pair<long long, long long> > v[n + 1];
    long long ans = 0;
    for (long long i = 0; i < n; i++) {
      cin >> k[i] >> l[i] >> r[i];
      v[k[i] - 1].push_back({l[i] - r[i], i});
      ans += r[i];
    }
    priority_queue<pair<long long, long long> > q;
    bool used[n];
    bool mas[n];
    fill(mas, mas + n, false);
    fill(used, used + n, false);
    for (long long i = n - 1; i >= 0; i--) {
      for (long long j = 0; j < v[i].size(); j++) q.push(v[i][j]);
      if (q.size() == 0) continue;
      pair<long long, long long> p = q.top();
      if (p.first >= 0) {
        mas[i] = true;
        used[p.second] = true;
        ans += p.first;
        q.pop();
      }
    }
    long long noko = 0;
    for (;;) {
      if (q.size() == 0) break;
      pair<long long, long long> p = q.top();
      if (p.first >= 0) {
        noko++;
        q.pop();
      } else
        break;
    }
    long long cnn = 0;
    for (long long i = 0; i < n; i++) cnn += mas[i];
    fill(mas, mas + n, false);
    for (long long i = 0; i < cnn; i++) mas[i] = true;
    fill(used, used + n, false);
    for (long long i = 0; i < n; i++) {
      if (mas[i] == false) {
        if (noko > 0)
          noko--;
        else {
          for (;;) {
            pair<long long, long long> p = q.top();
            if (used[p.second]) {
              q.pop();
              continue;
            } else {
              ans += p.first;
              used[p.second] = true;
              q.pop();
              break;
            }
          }
        }
      }
      for (long long j = 0; j < v[i].size(); j++) {
        if (v[i][j].first < 0) {
          if (used[v[i][j].second] == false) {
            used[v[i][j].second] = true;
            noko++;
          }
        }
      }
    }
    cout << ans << endl;
  }
}
