#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int T;
  cin >> T;
  while(T--) {
    int N;
    cin >> N;
    vector< int > K(N), L(N), R(N);
    int64 base = 0;
    vector< vector< int > > ev(N + 1);
    for(int i = 0; i < N; i++) {
      cin >> K[i] >> L[i] >> R[i];
      base += L[i];
      R[i] -= L[i];
      ev[K[i]].emplace_back(i);
    }
    priority_queue< pair< int, int > > que;
    vector< int > used(N), day(N);
    for(int i = 0; i < N; i++) {
      for(auto &p : ev[i]) {
        que.emplace(R[p], p);
      }
      if(que.size() && que.top().first > 0) {
        base += que.top().first;
        used[que.top().second] = true;
        day[i] = true;
        que.pop();
      }
    }
    while(!que.empty()) que.pop();
    multiset< pair< int, int > > st;
    for(int i = 0; i < N; i++) {
      if(used[i]) continue;
      st.emplace(R[i], i);
    }
    for(auto &p : ev[N]) {
      if(used[p]) continue;
      if(st.count(make_pair(R[p], p))) {
        st.erase(make_pair(R[p], p));
        st.emplace(0, p);
      }
    }
    for(int i = N - 1; i >= 0; i--) {
      for(auto &p : ev[i]) {
        if(used[p]) continue;
        if(st.count(make_pair(R[p], p))) {
          st.erase(make_pair(R[p], p));
          st.emplace(0, p);
        }
      }
      if(day[i]) continue;
      base += st.rbegin()->first;
      st.erase(prev(end(st)));
    }
    // [0,0,0,0] (-1,-1,-1)
    //  0,0,0,0,0,0   -5,-5
    cout << base << "\n";
  }
}