#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
template <typename T>
using Vec1 = vector<T>;
template <typename T>
using Vec2 = vector<Vec1<T> >;
template <typename T>
bool chmax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
ll pow2(const T n) {
  return (1LL << n);
}
template <typename T>
void cosp(const T n) {
  cout << n << ' ';
}
void co(void) { cout << '\n'; }
template <typename T>
void co(const T n) {
  cout << n << '\n';
}
template <typename T1, typename T2>
void co(pair<T1, T2> p) {
  cout << p.first << ' ' << p.second << '\n';
}
template <typename T>
void co(const Vec1<T> &v) {
  for (T i : v) cosp(i);
  co();
}
template <typename T>
void co(initializer_list<T> v) {
  for (T i : v) cosp(i);
  co();
}
template <typename T>
void ce(const T n) {
  cerr << n << endl;
}
void sonic() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
constexpr int INF = 1e9 + 1;
constexpr ll LINF = 1e18 + 1;
constexpr ll MOD = 1e9 + 7;
constexpr ld EPS = 1e-11;
const ld PI = acos(-1);
struct rakuda {
  ll k, l, r;
  void input() { cin >> k >> l >> r; }
};
bool asc(rakuda &a, rakuda &b) { return a.k < b.k; }
template <typename T>
struct extended_priority_queue {
  priority_queue<T> a, b;
  bool empty() { return a.empty(); }
  void push(T x) { a.push(x); }
  T top() { return a.top(); }
  void pop() { erase(a.top()); }
  size_t size() { return a.size() - b.size(); }
  void erase(T x) {
    b.push(x);
    while (!a.empty() && a.top() == b.top()) {
      a.pop();
      b.pop();
    }
  }
};
void solve() {
  ll n;
  cin >> n;
  vector<rakuda> a(n);
  for (ll i = (0); i < (n); ++i) a[i].input();
  sort((a).begin(), (a).end(), asc);
  priority_queue<P> pq;
  extended_priority_queue<P> epq, memo;
  ll ans = 0;
  for (ll i = (0); i < (n); ++i) {
    if (a[i].l <= a[i].r) {
      ans += a[i].r;
      memo.push({-a[i].k, a[i].l - a[i].r});
      epq.push({a[i].l - a[i].r, a[i].k});
    } else {
      ans += a[i].l;
      pq.push({a[i].r - a[i].l, a[i].k});
    }
    while (pq.size() > a[i].k) {
      P t = pq.top();
      ans += t.first;
      pq.pop();
    }
    while (!memo.empty() && memo.top().first >= -pq.size()) {
      P t = memo.top();
      epq.erase({memo.top().second, -memo.top().first});
      memo.pop();
    }
    while (epq.size() > n - a[i].k) {
      P t = epq.top();
      ans += t.first;
      epq.pop();
      memo.erase({-memo.top().second, memo.top().first});
    }
  }
  co(ans);
}
int main(void) {
  ll t;
  cin >> t;
  for (ll i = (0); i < (t); ++i) solve();
  return 0;
}
