#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, LL>P;
const int M = 2e3 + 5;
const LL mod = 998244353;
const LL lINF = 0x3f3f3f3f3f3f3f3f;
#define ls (rt<<1)
#define rs (rt<<1|1)
LL gcd(LL a, LL b) { return b ? gcd(b, a%b) : a; }
struct node {int l, r;LL sum, lsmx, rsmx, mx;
}tr[M * 4];
LL a[M];
LL pre, ans;//pre前一个搜索区间从右端点开始的最大子段和,ans当前最大值
void pushup(int rt)
{tr[rt].sum = tr[ls].sum + tr[rs].sum;tr[rt].lsmx = max(tr[ls].sum + tr[rs].lsmx,tr[ls].lsmx);tr[rt].rsmx = max(tr[rs].sum + tr[ls].rsmx,tr[rs].rsmx);tr[rt].mx = max(max(tr[ls].mx, tr[rs].mx), tr[ls].rsmx + tr[rs].lsmx);
}
void build(int rt, int l, int r)
{tr[rt].l = l, tr[rt].r = r;if (l == r){tr[rt].sum += a[l];tr[rt].lsmx += a[l];tr[rt].rsmx += a[l];tr[rt].mx += a[l];return;}int mid = (l + r) >> 1;build(ls, l, mid);build(rs, mid + 1, r);pushup(rt);
}
void update(int rt, int l, int r, int pos, LL v)
{if (l == r){tr[rt].sum += v;tr[rt].lsmx += v;tr[rt].rsmx += v;tr[rt].mx += v;return;}int mid = (l + r) >> 1;if (pos <= mid)update(ls, l, mid, pos, v);elseupdate(rs, mid + 1, r, pos, v);pushup(rt);
}
void query(int rt, int ql, int qr)
{if (ql <= tr[rt].l&&tr[rt].r <= qr){ans = max(ans, tr[rt].mx);ans = max(ans, pre + tr[rt].lsmx);pre = max(pre + tr[rt].sum, tr[rt].rsmx);return;}int mid = (tr[rt].l + tr[rt].r) >> 1;if (ql <= mid){query(ls, ql, qr);}if (qr > mid){query(rs, ql, qr);}}
int n;
int q;
LL x[M], y[M], val[M];
LL xid[M], yid[M];
int xsz, ysz;
vector<P>ve[M];
int main()
{int _;scanf("%d", &_);while (_--){scanf("%d", &n);for (int i = 1; i <= n; i++){scanf("%lld%lld%lld", &x[i], &y[i], &val[i]);xid[i] = x[i];yid[i] = y[i];}sort(yid + 1, yid + 1 + n);sort(xid + 1, xid + 1 + n);xsz = unique(xid + 1, xid + 1 + n) - (xid + 1);ysz = unique(yid + 1, yid + 1 + n) - (yid + 1);for (int i = 1; i <= ysz; i++){ve[i].clear();}for (int i = 1; i <= n; i++){int xi, yi;xi = lower_bound(xid + 1, xid + 1 + xsz, x[i]) - xid;yi = lower_bound(yid + 1, yid + 1 + ysz, y[i]) - yid;ve[yi].push_back(make_pair(xi, val[i]));}ans = 0;for (int i = 1; i <= ysz; i++)//下边界
        {memset(tr, 0, sizeof tr);for (int j = i; j >= 1; j--)//上边界
            {for (auto tmp : ve[j]){update(1, 1, xsz, tmp.first, tmp.second);}ans = max(ans, tr[1].mx);}}printf("%lld\n", ans);}
}