#include<bits/stdc++.h>
namespace rgs = std::ranges;
using std::cin, std::cout;
using ll = long long;
using u64 = unsigned long long;
using db = double;
struct ob {
	int x, y, w;
	auto operator <=> (const ob &) const = default;
};

struct pr {
	ll pre, suf, max, sum;
	void inc(ll v) {
		sum += v, pre = suf = max = std::max(sum, 0ll);
	}
};
pr merge(pr x, pr y) {
	return (pr) {
		std::max(x.pre, x.sum + y.pre),
		std::max(y.suf, x.suf + y.sum),
		std::max({x.max, y.max, x.suf + y.pre}),
		x.sum + y.sum
	};
}
const int N = 2005;
int L;
pr a[N << 3];
void init(int n) {
	L = 2 << std::__lg(n);
	for(int i = 1;i <= L * 2;++i) a[i] = {};
}

void upt(int p, int v) {
	a[p += L].inc(v);
	for(;p >>= 1;)
		a[p] = merge(a[p << 1], a[p << 1 | 1]);
}


void solve() {
	int n; cin >> n;
	std::vector<ob> a(n);
	std::vector<int> vy;
	for(auto & [x, y, w] : a) {
		cin >> x >> y >> w;
		vy.push_back(y);
	}
	sort(a.begin(), a.end());
	rgs::sort(vy);
	ll ans = 0;
	for(int i = 0;i < n;++i) {
		a[i].y = lower_bound(vy.begin(), vy.end(), a[i].y) - vy.begin() + 1;
	}
	for(int i = 0;i < n;++i) {
		if(!i || a[i].x != a[i - 1].x) {
			init(n);
			for(int j = i, k = j;j < n;j = k) {
				for(;k < n && a[k].x == a[j].x;++k) ;
				for(int l = j;l < k;++l) {
					upt(a[l].y, a[l].w);
				}
				ans = std::max(ans, ::a[1].max);
			}
		}
	}
	cout << ans << '\n';
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	int T; cin >> T;
	for(int i = 0;i < T;++i) {
		solve();
	}
}