#define _CRT_SECURE_NO_WARNINGS
#define REL

#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <iomanip>
#include <cstdio>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <string>
#include <set>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <cassert>
#include <complex>
#include <stack> 
#include <random>

using namespace std;

typedef int64_t i64;
typedef long long LL;
typedef long long ll;
typedef long double LD;
typedef complex <LD> cld;
typedef unsigned int uint;
typedef complex <double> cd;
typedef unsigned long long ULL;

#define endl "\n"
#define dendl "\n\n"
#define mp make_pair
#define mt make_tuple
#define size(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

/////////////////////////////////////////////////////////////////////

template <typename T>
T sqr(T a) {
	return a * a;
}

template <typename T>
int sign(T a) {
	if (a == 0)
		return 0;
	return (a > 0 ? 1 : -1);
}

template <typename T>
bool uax(T& a, const T b) {
	if (a < b) {
		a = b;
		return true;
	}
	return false;
}

template <typename T>
bool uin(T& a, const T b) {
	if (a > b) {
		a = b;
		return true;
	}
	return false;
}

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

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

mt19937_64 rnd(0);

const int LOG = 64;
const int N = (int)2e5 + 7;
const int MAXN = (int)1e6 + 7;
const int MOD = (int)1e9 + 7;
const int INF = (int)2e9 + 7;
const int CONST = 450;
const LL LINF = (i64)1e18;
const LD PI = 3.1415926535897932384626433832795;
const LD EPS = 1;

/////////////////////////////////////////////////////////////////////

LL get(vector <pair<int, int>>& v) {
	sort(all(v), [](const pair<int, int>& a, const pair<int, int>& b) {
		if (a.first == b.first)
			return a.second > b.second;
		return a.first < b.first;
	});
	int n = size(v);
	map <int, int> done;
	int t = 0, ind = 0, rest = 0;
	while (ind < n) {
		int st = v[ind].first;
		rest += v[ind].first - t;
		while (ind < n && v[ind].first == st) {
			if (rest > 0)
				done[v[ind].second]++, rest--;
			else {
				auto it = done.begin();
				int val, cnt;
				tie(val, cnt) = (*it);
				if (val < v[ind].second) {
					if (cnt == 1)
						done.erase(done.begin());
					else
						done[val]--;
					done[v[ind].second]++;
				}
			}
			ind++;
		}
		t = st;
	}
	LL res = 0;
	for (auto it : done)
		res += 1LL * it.first * it.second;
	return res;
}

void solve() {
	int n; cin >> n;
	vector <int> k(n), l(n), r(n);
	LL ans = 0;
	vector <pair<int, int>> kek1, kek2;
	for (int i = 0; i < n; i++) {
		cin >> k[i] >> l[i] >> r[i];
		if (k[i] == n) {
			ans += l[i];
			continue;
		}
		if (l[i] >= r[i]) {
			ans += r[i];
			kek1.push_back(mp(k[i], l[i] - r[i]));
		}
		else {
			ans += l[i];
			kek2.push_back(mp(n - k[i], r[i] - l[i]));
		}
	}
	ans += get(kek1);
	ans += get(kek2);
	cout << ans << endl;
}

int main() {
	double start = clock();
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	cout << fixed << setprecision(20);
	cerr << fixed << setprecision(20);
#else
	cout << fixed << setprecision(20);
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	rnd.seed(time(0));
#endif

	int t = 1;
	cin >> t;
	for (int i = 0; i < t; i++) {
		solve();
	}

#ifdef _DEBUG
	cout << endl << "Time is " << (clock() - start) / 1000.0;
#endif
}

Measured memory_bytes: 9932