#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) int idx,
               __attribute__((unused)) int LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
double get_time() { return 1.0 * clock() / CLOCKS_PER_SEC; }
vector<pair<int, int>> vals;
struct comp {
  bool operator()(const int i, const int j) const {
    return vals[i].second - vals[i].first > vals[j].second - vals[j].first;
  }
};
void solve() {
  int n;
  cin >> n;
  vals.clear();
  vector<vector<int>> camels(n);
  vector<int> len(n), taken(n);
  for (int i = 0; i < n; i++) {
    int k, l, r;
    cin >> k >> l >> r;
    --k;
    vals.emplace_back(l, r);
    camels[k].push_back(i);
    len[i] = k;
  }
  set<int, comp> active, inactive;
  long long res = 0;
  for (int i = 0; i < n; i++)
    for (auto pp : camels[i]) active.insert(pp);
  for (int i = n - 1; i >= 0; i--) {
    for (int pos : camels[i]) {
      if (active.find(pos) != active.end()) {
        active.erase(pos);
        inactive.insert(pos);
      }
    }
    if (active.empty()) {
      continue;
    }
    int idx = *active.begin();
    if (inactive.empty() || vals[idx].second >= vals[idx].first) {
      taken[i] = true;
      active.erase(active.begin());
      res += vals[idx].second;
    } else {
      int pos = *inactive.rbegin();
      inactive.erase(pos);
      res += vals[pos].first;
    }
  }
  cout << res << '\n';
}
int main() {
  fast();
  int t;
  cin >> t;
  while (t--) solve();
}
