#include <bits/stdc++.h>
#pragma GCC optimize("O3")
long mod(long a) {
  long long c = a % (long long)(1e9 + 7);
  if (c >= 0) return c;
  return c + (long long)(1e9 + 7);
}
long long po(long a, long b) {
  if (b == 0) {
    return 1;
  }
  long long z = po(a, b / 2);
  z = mod(z * z);
  if (b % 2 != 0) {
    z = mod(a * z);
  }
  return z;
}
bool prime_(int n) {
  if (n == 1) {
    return false;
  } else if (n == 2) {
    return true;
  } else {
    for (int i = 2; i <= std::sqrt(n); i++) {
      if (n % i == 0) {
        return false;
      }
    }
    return true;
  }
}
long long gcd_(long long a, long long b) {
  if (a < b) {
    std::swap(a, b);
  }
  if (a % b == 0) {
    return b;
  } else {
    return gcd_(b, a % b);
  }
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
int main() {
  using namespace std;
  int t;
  cin >> t;
  using P = pair<int, long long>;
  using PP = pair<P, int>;
  for (int _ = 0; _ < t; _++) {
    int n;
    cin >> n;
    int k[n];
    long long l[n], r[n];
    for (int i = 0; i < n; i++) {
      cin >> k[i] >> l[i] >> r[i];
      k[i]--;
    }
    vector<bool> used(n, false);
    priority_queue<PP> q1;
    priority_queue<PP> q2;
    int now = 0;
    long long res = 0;
    for (int i = 0; i < n; i++) {
      if (l[i] <= r[i]) continue;
      used[i] = true;
      q1.push(PP(P(-k[i], l[i] - r[i]), i));
    }
    while (!q1.empty()) {
      PP p = q1.top();
      q1.pop();
      int tk = -p.first.first;
      int index = p.second;
      if (now <= tk) {
        res += l[index];
        now++;
      } else {
        res += r[index];
      }
    }
    for (int i = 0; i < n; i++) {
      if (used[i]) continue;
      q2.push(PP(P(k[i], r[i] - l[i]), i));
    }
    now = n - 1;
    while (!q2.empty()) {
      PP p = q2.top();
      q2.pop();
      int tk = p.first.first;
      int index = p.second;
      if (now > tk) {
        res += r[index];
        now--;
      } else {
        res += l[index];
      }
    }
    cout << res << endl;
  }
  return 0;
}
