#define _CRT_SECURE_NO_DEPRECATE
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define int long long int
#define SYNC std::ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define FRE freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
typedef vector<ii>   vii;
//typedef tree<int, null_type, less<int>, rb_tree_tag, 
//             tree_order_statistics_node_update> 
//    ost;
#define rep(i,l,r)   for (int i = (l); i < (r); i++)
#define here cout << " Hey!!\n";
#define  pb push_back
#define  F  first
#define  S  second
#define all(v) (v).begin(),(v).end()
#define sz(a) (int)((a).size())
#define sq(x) ((x)*(x))
template <typename T>
void etch(T V) {
	for (auto x : V)	cout << x << ' ' ;
	cout << '\n';
}
vector<string> vec_splitter(string s) {
	s += ',';
	vector<string> res;
	while(!s.empty()) {
		res.push_back(s.substr(0, s.find(',')));
		s = s.substr(s.find(',') + 1);
	}
	return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)) int idx, 
__attribute__ ((unused)) int LINE_NUM) { cerr << endl; } 
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
	if(idx > 0) cerr << ", "; else cerr << "Line(" << LINE_NUM << ") ";
	stringstream ss; ss << H;
	cerr << args[idx] << " = " << ss.str();
	debug_out(args, idx + 1, LINE_NUM, T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define debug(...) 42
#endif
const int MOD = 1e9+7;
const int MOD1 = 998244353;
const int N = 2e5+5;
const int INF = 1000111000111000111LL;
const ld EPS = 1e-12;
const ld PI = 3.141592653589793116;

struct pt {
	int ki;
	int profit;
};
bool comp(pt &a, pt &b) {
	return a.ki < b.ki;
}

int solve() 
{
	int n;	cin >> n;	
	int ans = 0;
	vector<pt> vf, vb;
	for (int i = 0; i < n; i++) {
		int k, l, r;
		cin >> k >> l >> r;
		if (l >= r) {
			pt tmp;
			tmp.profit = l - r;
			tmp.ki = k;
			vf.pb(tmp);
		} else {
			pt tmp;
			tmp.profit = r - l;
			tmp.ki = n - k;
			vb.pb(tmp);
		}
		ans += min(l, r);
	}
	sort(all(vb), comp);
	sort(all(vf), comp);
	multiset<int> st;
	for (auto it : vf) {
		if (sz(st) < it.ki) {
			st.insert(it.profit);
			continue;
		}
		if (*st.begin() >= it.profit) {
			continue;
		}
		auto nt = st.begin();
		st.erase(nt);
		st.insert(it.profit);
	}
	for (auto it : st) ans += it;
	while(!st.empty()) 
		st.erase(st.begin());
	// for(auto it : vf) {
	// 	debug(it.ki, it.profit);
	// }
	// for(auto it : vb) {
	// 	debug(it.ki, it.profit);
	// }
	for (auto it : vb) {
		if (sz(st) < it.ki) {
			st.insert(it.profit);
			continue;
		}
		if (st.empty()) {
			continue;
		}
		if (*st.begin() >= it.profit) {
			continue;
		}
		auto nt = st.begin();
		st.erase(nt);
		st.insert(it.profit);
	}
	for (auto it : st) ans += it;
	cout << ans << '\n';
	return 0;
}

int32_t main()
{
	SYNC
	int T; cin >> T;
	while(T--) {
		solve();
	}
	return 0;
}


Measured memory_bytes: 11084