#include <bits/stdc++.h>
using namespace std;
 
using ll = int64_t;
constexpr ll mod = ll(1e9 + 7);
 
template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef COMPETITIVE_PROGRAMMING_LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) if(0){}
#endif

int main () {
  ios::sync_with_stdio(0); cin.tie(0);
 
  ll TT = 1;
  cin >> TT;
  while (TT--) {
    ll n,k,l,r;
    cin >> n;
    ll ans = 0;
    vector<tuple<int,int,int,int>> vals;
    for (ll i = 1; i <= n; ++i) {
      cin >> k >> l >> r;
      vals.emplace_back(k, l - r, l, r);
    }
    sort(vals.begin(), vals.end(), [](const auto& a, const auto& b) {
                                     auto [kth0, dx0, l0, r0] = a;
                                     auto [kth1, dx1, l1, r1] = b;
                                     if (dx0 < 0 && dx1 < 0) {
                                       return kth0 > kth1;
                                     } else if (dx0 < 0 && dx1 > 0) {
                                       return false;
                                     } else if (dx0 > 0 && dx1 < 0) {
                                       return true;
                                     } else {
                                       return kth0 < kth1;
                                     }
                                   });
//    dbg(vals);
    for (int i = 1; i <= n; ++i) {
      auto [kth, dx, l, r] = vals[i-1];
      if (i <= kth) {
        ans += l;
      } else {
        ans += r;
      }
    }


    cout << ans << endl;

  }
}
