#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const long long int MOD = 1000000000 + 7;
struct UnionFind {
  vector<int> parent;
  UnionFind(int N) : parent(N) {
    for (int i = 0; i < N; i++) {
      parent[i] = -1;
    }
  }
  int root(int i) {
    if (parent[i] < 0) {
      return i;
    }
    return (parent[i] = root(parent[i]));
  }
  bool unite(int from, int to) {
    int rx = root(from);
    int ry = root(to);
    if (rx != ry) {
      parent[ry] += parent[rx];
      parent[rx] = ry;
      return true;
    } else {
      return false;
    }
  }
  bool same(int x, int y) { return root(x) == root(y); }
  int treeSize(int x) { return -parent[root(x)]; }
};
long long int modpow(long long int base, long long int pow, long long int mod) {
  if (pow == 1) {
    return base;
  } else if (pow == 0) {
    return 1;
  }
  if (pow % 2 == 0) {
    auto temp = modpow(base, pow / 2, mod);
    return (temp * temp) % mod;
  } else {
    return (base * modpow(base, pow - 1, mod)) % mod;
  }
}
long long int moddiv(long long int X, long long int Y, long long int mod) {
  auto fermatDiv = modpow(Y, mod - 2, mod);
  return (X * fermatDiv) % mod;
}
long long modCombination(long long left, long long right, long long int mod) {
  long long answer = 1;
  if (left > right) {
    for (long long i = 0; i < right; i++) {
      answer = (answer * (left - i)) % mod;
      answer = moddiv(answer, (i + 1), mod);
    }
  }
  return answer;
}
bool IsPrime(long long N) {
  if (N == 1) {
    return false;
  }
  for (long long i = 2; i * i <= N; i++) {
    if (N % i == 0) {
      return false;
    }
  }
  return true;
}
vector<pair<long long, long long>> prime_factorize(long long N) {
  vector<pair<long long, long long>> res;
  for (long long a = 2; a * a <= N; ++a) {
    if (N % a != 0) continue;
    long long ex = 0;
    while (N % a == 0) {
      ++ex;
      N /= a;
    }
    res.push_back({a, ex});
  }
  if (N != 1) res.push_back({N, 1});
  return res;
}
map<long long, set<long long>> cache;
set<long long> enum_divisors(long long N) {
  set<long long> res;
  for (long long i = 1; i * i <= N; ++i) {
    if (N % i == 0) {
      res.insert(i);
      if (cache.count(N / i) > 0) {
        auto copy = cache[N / i];
        auto copy2 = cache[N / i];
        for (auto v : res) {
          if (v != 1) {
            for (auto itr = copy2.begin(); itr != copy2.end(); itr++) {
              copy.insert(*itr * v);
            }
            break;
          }
        }
        cache[N] = copy;
        return copy;
      }
      if (N / i != i) res.insert(N / i);
    }
  }
  cache[N] = res;
  return res;
}
long long euclid(long long a, long long b) {
  if (a > b) {
    long long temp = b;
    b = a;
    a = temp;
  }
  if (b % a == 0) {
    return a;
  } else {
    return euclid(a, b - a);
  }
}
long long gcd(long long a, long long b) {
  if (b > a) {
    long long temp = b;
    b = a;
    a = temp;
  }
  long long c = a % b;
  if (c == 0) {
    return b;
  } else {
    return gcd(b, c);
  }
}
struct Camel {
 public:
  int K;

 public:
  int L, R;

 public:
  int minus;

 public:
  bool isForward;
  bool operator<(const Camel& right) const { return minus > right.minus; }
};
int main() {
  int T;
  cin >> T;
  for (int i = 0; i < T; i++) {
    int N;
    cin >> N;
    vector<Camel> camels(N);
    long long idealTotal = 0;
    int forwardCamelCount = 0;
    for (int i = 0; i < N; i++) {
      int K, L, R;
      cin >> K >> L >> R;
      camels[i].K = K;
      camels[i].L = L;
      camels[i].R = R;
      if (L > R) {
        camels[i].isForward = true;
        forwardCamelCount++;
      } else {
        camels[i].isForward = false;
      }
      camels[i].minus = max(L, R) - min(L, R);
      idealTotal += max(L, R);
    }
    vector<bool> party(N + 1, false);
    sort(party.begin(), party.end());
    for (auto& c : camels) {
      if (c.isForward) {
        bool isFound = false;
        for (int i = min(c.K, forwardCamelCount); i >= 1; i--) {
          if (!party[i]) {
            party[i] = true;
            isFound = true;
            break;
          }
        }
        if (!isFound) {
          idealTotal -= c.minus;
        }
      } else {
        bool isFound = false;
        for (int i = max(c.K + 1, N - forwardCamelCount); i <= N; i++) {
          if (!party[i]) {
            party[i] = true;
            isFound = true;
            break;
          }
        }
        if (!isFound) {
          idealTotal -= c.minus;
        }
      }
    }
    cout << idealTotal << endl;
  }
  return 0;
}
