#include <bits/stdc++.h>
auto& scan_in = std::cin;
template <typename T>
void MACRO_VAR_Scan(T& t) {
  scan_in >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  scan_in >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  scan_in >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  scan_in >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <typename T>
void MACRO_OUT(const T t) {
  std::cout << t;
}
template <typename First, typename... Rest>
void MACRO_OUT(const First first, const Rest... rest) {
  std::cout << first << " ";
  MACRO_OUT(rest...);
}
template <class S, class T, class U>
bool IN(S a, T x, U b) {
  return a <= x && x < b;
}
template <class T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <class T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
template <class T>
using V = std::vector<T>;
template <class T>
using VV = V<V<T>>;
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
  os << "{";
  for (size_t i = 0; i < v.size(); ++i)
    os << v[i] << ((i + 1 < v.size()) ? ", " : "");
  os << "}";
  return os;
}
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, const std::map<S, T>& m) {
  os << "{";
  for (auto it = m.cbegin(); it != m.cend();) {
    os << it->first << ":" << it->second;
    ++it;
    os << (it == m.cend() ? "" : ", ");
  }
  os << "}";
  return os;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::queue<T> q) {
  os << "<";
  while (!q.empty()) {
    os << q.front();
    q.pop();
    os << (q.empty() ? "<" : ", ");
  }
  return os;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::stack<T> q) {
  os << ">";
  while (!q.empty()) {
    os << q.top();
    q.pop();
    os << (q.empty() ? "]" : ", ");
  }
  return os;
}
namespace std {
template <typename S, typename T>
class numeric_limits<pair<S, T>> {
 public:
  static constexpr pair<S, T> max() noexcept {
    return {numeric_limits<S>::max(), numeric_limits<T>::max()};
  }
  static constexpr pair<S, T> lowest() noexcept {
    return {numeric_limits<S>::lowest(), numeric_limits<T>::lowest()};
  }
};
}  // namespace std
using i64 = std::int_fast64_t;
using u64 = std::uint_fast64_t;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<i64, i64>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;
constexpr int INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-6;
constexpr i64 MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N>
void FILL(T (&a)[N], const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T& val) {
  for (auto& b : a) FILL(b, val);
}
template <class T>
void FILL(std::vector<T>& a, const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>>& a, const T& val) {
  for (auto& b : a) FILL(b, val);
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  int Q;
  MACRO_VAR_Scan(Q);
  ;
  for (int _ = (0); _ < (Q); ++_) {
    int n;
    MACRO_VAR_Scan(n);
    ;
    std::vector<int> k, l, r;
    MACRO_VEC_ROW_Init(n, k, l, r);
    for (int w_ = 0; w_ < n; ++w_) {
      MACRO_VEC_ROW_Scan(w_, k, l, r);
    };
    i64 ans = 0;
    V<PAIR> a, b;
    for (int i = (0); i < (n); ++i) {
      int ma = std::max(l[i], r[i]);
      ans += ma;
      l[i] -= ma;
      r[i] -= ma;
      if (r[i] < 0)
        a.emplace_back(k[i], -r[i]);
      else
        b.emplace_back(k[i], l[i]);
    }
    std::sort((a).begin(), (a).end());
    std::sort((b).begin(), (b).end());
    std::reverse((b).begin(), (b).end());
    int p = 0;
    i64 sum = 0;
    for (int i = (0); i < (a.size()); ++i) {
      if (p >= a[i].first) sum -= a[i].second;
      ++p;
    }
    for (int i = (0); i < (b.size()); ++i) {
      if (p < b[i].first) sum += b[i].second;
      ++p;
    }
    MACRO_OUT(ans + sum);
    std::cout << "\n";
    ;
  }
  return 0;
}
