#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <typename T>
using mat = vector<vector<T>>;
template <int mod>
struct modint {
  int x;
  modint() : x(0) {}
  modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  modint &operator+=(const modint &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  modint &operator-=(const modint &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  modint &operator*=(const modint &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  modint &operator/=(const modint &p) {
    *this *= p.inverse();
    return *this;
  }
  modint operator-() const { return modint(-x); }
  modint operator+(const modint &p) const { return modint(*this) += p; }
  modint operator-(const modint &p) const { return modint(*this) -= p; }
  modint operator*(const modint &p) const { return modint(*this) *= p; }
  modint operator/(const modint &p) const { return modint(*this) /= p; }
  bool operator==(const modint &p) const { return x == p.x; }
  bool operator!=(const modint &p) const { return x != p.x; }
  modint inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return modint(u);
  }
  modint pow(int64_t n) const {
    modint ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }
  friend istream &operator>>(istream &is, modint &a) {
    int64_t t;
    is >> t;
    a = modint<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
T mypow(T x, ll n) {
  T ret = 1;
  while (n > 0) {
    if (n & 1) (ret *= x);
    (x *= x);
    n >>= 1;
  }
  return ret;
}
ll modpow(ll x, ll n, const ll mod) {
  ll ret = 1;
  while (n > 0) {
    if (n & 1) (ret *= x);
    (x *= x);
    n >>= 1;
    x %= mod;
    ret %= mod;
  }
  return ret;
}
uint64_t my_rand(void) {
  static uint64_t x = 88172645463325252ULL;
  x = x ^ (x << 13);
  x = x ^ (x >> 7);
  return x = x ^ (x << 17);
}
ll popcnt(ull x) { return __builtin_popcountll(x); }
template <typename T>
struct edge {
  int src, to;
  T cost;
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
  bool operator<(const edge<T> &r) const { return cost < r.cost; }
  operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T>>;
template <typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
struct Timer {
  clock_t start_time;
  void start() { start_time = clock(); }
  int lap() { return (clock() - start_time) * 1000 / CLOCKS_PER_SEC; }
};
const long double eps = 0.000001;
const long double PI = 3.141592653589793;
void solve() {
  int n;
  cin >> n;
  vector<ll> k(n), x(n);
  ll ans = 0;
  vector<ll> left, right;
  for (ll i = (0), max_i = (n); i < max_i; i++) {
    int l, r;
    cin >> k[i] >> l >> r;
    k[i]--;
    if (l - r > 0) {
      x[i] = l - r;
      ans += r;
      left.push_back(i);
    } else {
      x[i] = r - l;
      ans += l;
      right.push_back(i);
      k[i] = n - k[i] - 2;
    }
  }
  {
    sort((left).rbegin(), (left).rend(),
         [&](ll a, ll b) { return k[a] < k[b]; });
    multiset<ll, greater<ll>> s;
    auto iter = left.begin();
    for (ll i = (n - 1), min_i = (0); i >= min_i; i--) {
      while (iter != left.end() && k[*iter] >= i) {
        s.insert(x[*iter]);
        ++iter;
      }
      if (((ll)(s).size()) > 0) {
        ans += *s.begin();
        s.erase(s.begin());
      }
    }
  }
  {
    sort((right).rbegin(), (right).rend(),
         [&](ll a, ll b) { return k[a] < k[b]; });
    multiset<ll, greater<ll>> s;
    auto iter = right.begin();
    for (ll i = (n - 1), min_i = (0); i >= min_i; i--) {
      while (iter != right.end() && k[*iter] >= i) {
        s.insert(x[*iter]);
        ++iter;
      }
      if (((ll)(s).size()) > 0) {
        ans += *s.begin();
        s.erase(s.begin());
      }
    }
    for (ll x : s) ans += x;
  }
  cout << ans << '\n';
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << setprecision(20);
  int t;
  cin >> t;
  for (ll i = (0), max_i = (t); i < max_i; i++) {
    solve();
  }
}
