1 #include <cstdio>
 2 #include <iostream>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <queue>
 6 using namespace std;
 7 const int MAXN = 1e5 + 20;
 8
 9 int N;
10 struct event
11 {
12     int s, t, w;
13     bool operator <(const event &rhs) const{
14         return t > rhs.t;
15     }
16 }E[MAXN];
17
18 bool cmp1(const event &lhs, const event &rhs){
19     return lhs.s < rhs.s;
20 }
21 int last = 0;
22
23 inline bool check(int x)
24 {
25     priority_queue<event> q;
26     int cnt = 1;
27     for(int i = 1; i <= last; i++)
28     {
29         while(cnt <= N && E[cnt].s < i) q.push(E[cnt++]);
30
31         int v = x;
32         while(!q.empty() && v > 0)
33         {
34             event u = q.top(); q.pop();
35             if(u.t < i) return false;
36             if(u.w > v){
37                 u.w -= v;
38                 q.push(u);
39                 break;
40             }
41             else v -= u.w;
42         }
43         if(cnt == N + 1 && q.empty()) return true;
44     }
45     return false;
46 }
47
48 int main()
49 {
50     int T;
51     cin>>T;
52     while(T--)
53     {
54         last = 0;
55         cin>>N;
56         int l = 0, r = 0;
57         for(int i = 1; i <= N; i++)
58             scanf("%d%d%d", &E[i].s, &E[i].t, &E[i].w),
59             r += E[i].w, last = max(last, E[i].t);
60
61         sort(E + 1, E + N + 1, cmp1);
62
63         #define mid (((l) + (r)) >> 1)
64         while(l < r)
65         {
66             if(check(mid)) r = mid;
67             else l = mid + 1;
68         }
69         printf("%d\n", l);
70     }
71     return 0;
72 }