#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<string>

 #include<algorithm>

 #define lson l, mid, i << 1

 #define rson mid + 1, r, i << 1 | 1

 using namespace std;

 typedef long long ll;

 const int maxn =  + ;

 struct node {

     ll sum, max_sum, max_q, max_h;//区间和，区间最大子段和，最大前缀和，最大后缀和。

 }T[maxn * ];

 struct P {

     int x, y;

     ll w;

 }p[maxn];

 int x[maxn], y[maxn];

 bool cmp(P a, P b) {

     if (a.y == b.y)

         return a.x < b.x;

     return a.y < b.y;

 }

 void up(int i) {

     T[i].sum = T[i << ].sum + T[i <<  | ].sum;

     T[i].max_sum = max(T[i <<  | ].max_q + T[i << ].max_h, max(T[i << ].max_sum, T[i <<  | ].max_sum));

     T[i].max_q = max(T[i << ].max_q, T[i << ].sum + T[i <<  | ].max_q);

     T[i].max_h = max(T[i <<  | ].max_h, T[i << ].max_h + T[i <<  | ].sum);

 }

 void build(int l, int r, int i) {

     T[i].sum = T[i].max_sum = T[i].max_q = T[i].max_h = ;

     if (l == r)

         return;

     int mid = l + r >> ;

     build(lson);

     build(rson);

 }

 void update(int pos, int w, int l, int r, int i) {

     if (l == r) {

         T[i].sum += w;

         T[i].max_sum = T[i].max_q = T[i].max_h = T[i].sum;

         return;

     }

     int mid = l + r >> ;

     if (pos <= mid)

         update(pos, w, lson);

     else

         update(pos, w, rson);

     up(i);

 }

 ll f[maxn];

 int main() {

     int t;

     scanf("%d", &t);

     while (t--) {

         int n;

         ll ans = ;

         scanf("%d", &n);

         for (int i = ; i <= n; i++) {

             scanf("%d%d%lld", &p[i].x, &p[i].y, &p[i].w);

             x[i] = p[i].x, y[i] = p[i].y;

         }

         sort(x + , x +  + n);

         sort(y + , y +  + n);

         int xx = unique(x + , x +  + n) - x - , yy = unique(y + , y +  + n) - y - ;

         for (int i = ; i <= n; i++) {

             p[i].x = lower_bound(x + , x +  + xx, p[i].x) - x;

             p[i].y = lower_bound(y + , y +  + yy, p[i].y) - y;

         }

         sort(p + , p +  + n, cmp);

         int now = ;

         for (int i = ; i <= yy; i++) {

             build(, xx, );

             for (int j = i, k = now; j <= yy; j++) {

                 while (k <= n && p[k].y == j) {

                     update(p[k].x, p[k].w, , xx, );

                     k++;

                 }

                 if (j == i)

                     now = k;

                 ans = max(ans, T[].max_sum);

             }

         }

         printf("%lld\n", ans);

     }

 }