#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  err(++it, args...);
}
template <class T, class U>
inline void checkmin(T &x, U y) {
  if (y < x) x = y;
}
template <class T, class U>
inline void checkmax(T &x, U y) {
  if (y > x) x = y;
}
template <class T, class U>
inline bool ifmax(T &x, U y) {
  if (y > x) return x = y, true;
  return false;
}
template <class T, class U>
inline bool ifmin(T &x, U y) {
  if (y < x) return x = y, true;
  return false;
}
long long fstpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a);
    a = (a * a);
    b >>= 1;
  }
  return res;
}
long long powm(long long a, long long b, long long mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
void fukof() {}
void problem() {}
const long long mod = 1e9 + 7;
const long long N = 1000005;
const long long inf = 1e9;
void solve() {
  int n;
  cin >> n;
  long long sum = 0;
  vector<pair<long long, long long> > pos, neg;
  for (long long i = 0; i < (n); i++) {
    long long k, l, r;
    cin >> k >> l >> r;
    sum += r;
    if (l - r >= 0)
      pos.push_back({l - r, k});
    else
      neg.push_back({r - l, k});
  }
  set<long long> s;
  sort(pos.begin(), pos.end());
  sort(neg.begin(), neg.end());
  reverse(pos.begin(), pos.end());
  reverse(neg.begin(), neg.end());
  for (long long i = 0; i < (n); i++) s.insert(i + 1);
  s.insert(mod);
  s.insert(0ll);
  vector<long long> ans(n + 1, -1);
  vector<long long> not_used;
  for (long long i = 0; i < (pos.size()); i++) {
    auto it = s.lower_bound(pos[i].second);
    if (*it != 0) {
      if (*it == pos[i].second) {
        ans[*it] = pos[i].first;
        s.erase(it);
      } else {
        it--;
        ans[*it] = pos[i].first;
        s.erase(it);
      }
    } else
      not_used.push_back(pos[i].first);
  }
  vector<long long> real;
  for (long long i = 0; i < (n + 1); i++) {
    if (ans[i] != -1) real.push_back(ans[i]);
  }
  for (long long i = 0; i < (not_used.size()); i++) {
    real.push_back(not_used[i]);
    sum -= not_used[i];
  }
  for (long long i = 0; i < (real.size()); i++) sum += real[i];
  s.clear();
  for (long long i = 0; i < (n); i++) s.insert(i + 1);
  s.insert(mod);
  s.insert(0ll);
  vector<long long> nans(n + 1, -1);
  not_used.clear();
  for (long long i = 0; i < (neg.size()); i++) {
    auto it = s.lower_bound(neg[i].second + 1);
    if (*it != mod) {
      nans[*it] = neg[i].first;
      s.erase(it);
    } else {
      not_used.push_back(neg[i].first);
    }
  }
  for (long long i = 0; i < (not_used.size()); i++) sum -= not_used[i];
  cout << sum << endl;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  cout << fixed << setprecision(15);
  int tc = 1;
  cin >> tc;
  while (tc--) {
    problem();
    fukof();
    solve();
  }
  return 0;
}
