#include<bits/stdc++.h>
using namespace std;

#define int long long

using pii=pair<int,int>;

const int N=2e3+1e2+7;

int T,n,x[N],y[N],w[N];

vector<pii> a[N];

vector<int> X,Y;

int m;

struct Data{
    int lmx,rmx,smx,sum;
}t[N*10];

Data operator +(const Data &a,const Data &b) 
{
    return {max(a.lmx,a.sum+b.lmx),max(b.rmx,b.sum+a.rmx),max({a.smx,b.smx,a.rmx+b.lmx}),a.sum+b.sum};
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>T;
    while(T--)
    {
        cin>>n;
        X.clear(),Y.clear();
        for(int i=1;i<=n;i++)
            cin>>x[i]>>y[i]>>w[i],X.push_back(x[i]),Y.push_back(y[i]);
        sort(X.begin(),X.end());
        X.erase(unique(X.begin(),X.end()),X.end());
        sort(Y.begin(),Y.end());
        Y.erase(unique(Y.begin(),Y.end()),Y.end());
        for(int i=1;i<=n;i++)
            a[i].clear();
        for(int i=1;i<=n;i++)
        {
            x[i]=lower_bound(X.begin(),X.end(),x[i])-X.begin()+1,y[i]=lower_bound(Y.begin(),Y.end(),y[i])-Y.begin()+1;
            a[x[i]].push_back({y[i],w[i]});
        }
        m=1;
        while(m<Y.size())
            m<<=1;
        m--;
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            for(int k=1;k<=m*2+1;k++)
                t[k]={0,0,0,0};
            for(int j=i;j<=n;j++)
            {
                for(auto [y,w]:a[j])
                {
                    y+=m;
                    t[y].sum+=w;
                    t[y].smx=max(0ll,t[y].sum);
                    t[y].lmx=max(0ll,t[y].sum);
                    t[y].rmx=max(0ll,t[y].sum);
                    y>>=1;
                    while(y)
                        t[y]=t[y*2]+t[y*2+1],y>>=1;
                }
                ans=max(ans,t[1].smx);
            }
        }
        cout<<ans<<"\n";
    }
}