#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int T;
int N;
int K[MAX_N]; ll L[MAX_N], R[MAX_N];

ll pre(vi& vec, bool flip) {
	sort(all(vec), [&](int i1, int i2) {
			return K[i1] < K[i2];
			});
	if(!flip) {
		rep(i, 0, sz(vec)) {
			int idx = vec[i];
			MIN(K[idx], sz(vec) - 1);
		}
	}
	if(flip) {
		reverse(all(vec));
		rep(i, 0, sz(vec)) {
			int idx = vec[i];
			K[idx] = N - 2 - K[idx];
			MIN(K[idx], sz(vec) - 1);
			swap(L[idx], R[idx]);
		}
	}
	// debug("---");
	ll res = 0;
	rep(i, 0, sz(vec)) {
		int idx = vec[i];
		res += R[idx];
		L[idx] -= R[idx];
		R[idx] = 0;
	}
	// rep(i, 0, sz(vec)) {
	// 	int idx = vec[i];
	// 	debug(K[idx], L[idx], R[idx]);
	// }
	int at = 0;
	while(at < sz(vec) && K[vec[at]] < 0) at++;
	priority_queue<ll, vector<ll>, greater<ll>> que;
	rep(i, 0, sz(vec)) {
		while(at < sz(vec) && K[vec[at]] <= i) {
			res += L[vec[at]];
			que.push(L[vec[at]]);
			at++;
		}
		while(sz(que) > i + 1) {
			res -= que.top(); que.pop();
		}
	}
	return res;
}

void solve() {
	cin >> T;
	while(T--) {
		cin >> N;
		vi v1, v2;
		rep(i, 0, N) {
			cin >> K[i] >> L[i] >> R[i]; K[i]--;
			if(L[i] >= R[i]) v1.pb(i);
			else v2.pb(i);
		}
		ll res = 0;
		res += pre(v1, false);
		res += pre(v2, true);
		cout << res << "\n";
	}
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}




Measured memory_bytes: 9776