1 #include  2 #define ll long long int
 3 #define INF 0x3f3f3f3f
 4 #define mod 1000000007
 5 using namespace std;
 6 
 7 const int MAXN = 1e5+10;
 8 
 9 struct date{
10     int x, y, v;
11 }node[MAXN];
12 
13 int d[MAXN], dp[MAXN];
14 int t[MAXN1];
15 int N;
16 
17 bool cmp1(struct date a, struct date b)
18 {
19     if(a.x == b.x) return a.y > b.y;
20     return a.x  b.x;
21 }
22 int lowbit(int x)
23 {
24     return x&(-x);
25 }
26 void add(int st, int val)
27 {
28     for(int i = st; i lowbit(i))
29         t[i] = max(t[i], val);
30 }
31 int query(int st)
32 {
33     int res = 0;
34     for(int i = st; i > 0; i-=lowbit(i))
35         res = max(res, t[i]);
36     return res;
37 }
38 
39 int main()
40 {
41     int T;
42     scanf("%d", &T);
43     while(T--){
44         scanf("%d", &N);
45         memset(t, 0, sizeof(t));
46         for(int i = 1; i ){
47             scanf("%d%d%d", &node[i].x, &node[i].y, &node[i].v);
48             d[i] = node[i].y;
49         }
50         sort(d+1, d+N+1);
51         int last = unique(d+1, d+1+N)-1-d;
52         for(int i = 1; i )
53             node[i].y = lower_bound(d+1, d+1+last, node[i].y)-d;
54         sort(node+1, node+1+N, cmp1);
55         for(int i = 1; i )
56         {
57             int res = query(node[i].y-1) + node[i].v;
58             add(node[i].y, res);
59         }
60         printf("%d\n", query(MAXN-1));
61     }
62     return 0;
63 }