#include <bits/stdc++.h>using namespace std;
typedef double dou;
typedef  long long ll;
typedef pair<int, int> pii;
typedef map<int, int> mii;#define pai acos(-1.0)
#define M 4005
#define inf 0x3f3f3f3f
#define mod 1000000007
#define IN inline
#define left k<<1
#define right k<<1|1
#define lson L, mid, left
#define rson mid + 1, R, right
#define W(a) while(a)
#define lowbit(a) a&(-a)
#define ms(a,b) memset(a,b,sizeof(a))
#define Abs(a) (a ^ (a >> 31)) - (a >> 31)
#define false_stdio ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)int T, n;
ll vx[M], vy[M];
ll xlen, ylen, pos, ans;
struct Data {int x, y, val;bool operator <(Data& t) {return y < t.y;}
}node[M];
struct Data_t {ll sum;ll Lmax, Rmax, Max;
}tree[M << 2];IN void Updata(int L, int R, int k, int id,int add) {if (L == R) {tree[k].sum += (ll)add;tree[k].Lmax = tree[k].Rmax = tree[k].Max = tree[k].sum;return;}int mid = L + R >> 1;if (id <= mid)Updata(lson, id, add);else Updata(rson, id, add);//维护最大字段和tree[k].sum = tree[left].sum + tree[right].sum;tree[k].Lmax = max(tree[left].Lmax, tree[left].sum + tree[right].Lmax);tree[k].Rmax = max(tree[right].Rmax, tree[right].sum + tree[left].Rmax);tree[k].Max = max(max(tree[left].Max, tree[right].Max), tree[left].Rmax + tree[right].Lmax);
}int main() {false_stdio;cin >> T;W(T--) {cin >> n;for (int i = 1; i <= n; i++) {cin >> node[i].x >> node[i].y >> node[i].val;vx[i] = node[i].x, vy[i] = node[i].y;}//二维坐标离散化sort(vx + 1, vx + n + 1);sort(vy + 1, vy + n + 1);xlen = unique(vx + 1, vx + n + 1) - vx - 1;ylen = unique(vy + 1, vy + n + 1) - vy - 1;for (int i = 1; i <= n; i++) {node[i].x = lower_bound(vx + 1, vx + xlen + 1, node[i].x) - vx;node[i].y = lower_bound(vy + 1, vy + ylen + 1, node[i].y) - vy;}sort(node + 1, node + n + 1);ans = 0;//首先枚举下界for (int dw = 1; dw <= ylen; dw++) {pos = 1;memset(tree, 0, (xlen * 4 + 5) * sizeof(Data_t));//初始化线段树，离散化完有多少个点就初始化多大
W(node[pos].y < dw && pos <= n)pos++;//直接跳过小于下界的点for (int up = dw; up <= ylen; up++) {//枚举上界W(pos <= n && node[pos].y <= up) {//将上界与下届之间的点加入线段树中Updata(1, xlen, 1, node[pos].x, node[pos].val);pos++;}ans = max(ans, tree[1].Max);}}cout << ans << endl;}return 0;
}