#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()

const int N = 2005;

struct node {
    ll mx, sum, mxl, mxr;
} seg[N << 2];

int pos[N];

void build(int l, int r, int rt) {
    seg[rt].mx = seg[rt].sum = seg[rt].mxl = seg[rt].mxr = 0;
    if (l == r) {
        pos[l] = rt;
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, rt << 1), build(mid + 1, r, rt << 1 | 1);
}

void up(int rt) {
    seg[rt].mx = max({seg[rt << 1].mx, seg[rt << 1 | 1].mx, seg[rt << 1].mxr + seg[rt << 1 | 1].mxl});
    seg[rt].sum = seg[rt << 1].sum + seg[rt << 1 | 1].sum;
    seg[rt].mxl = max(seg[rt << 1].mxl, seg[rt << 1].sum + seg[rt << 1 | 1].mxl);
    seg[rt].mxr = max(seg[rt << 1].mxr + seg[rt << 1 | 1].sum, seg[rt << 1 | 1].mxr);
}

void modify(int x, ll v) {
    x = pos[x];
    seg[x].sum += v, seg[x].mx += v, seg[x].mxl += v, seg[x].mxr += v;
    while (x > 1) {
        x >>= 1;
        up(x);
    }
}

vector<int> val;

pii arr[2005];
int wei[2005], ycoord[2005];

void solve() {
    int n;
    cin >> n;
    vector<int> idx(n);
    iota(ALL(idx), 1);
    val.clear();
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i].X >> arr[i].Y >> wei[i];
        val.pb(arr[i].Y);
    }
    sort(ALL(val)), val.resize(unique(ALL(val)) - val.begin());
    sort(ALL(idx), [&](int x, int y) {
        return arr[x].X < arr[y].X; 
    });
    for (int i = 1; i <= n; ++i)
        ycoord[i] = upper_bound(ALL(val), arr[i].Y) - val.begin();
    ll ans = 0;
    for (int i = 0, j = 0; i < n; i = j) {
        while (j < SZ(idx) && arr[idx[i]].X == arr[idx[j]].X) ++j;
        build(1, SZ(val), 1);
        for (int a = i, b = i; a < n; a = b) {
            while (b < SZ(idx) && arr[idx[a]].X == arr[idx[b]].X) { 
                modify(ycoord[idx[b]], wei[idx[b]]);
                ++b;
            }
            ans = max(ans, seg[1].mx);
        }
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}