#include<iostream>

 #include<algorithm>

 #include<string>

 #include<queue>

 using namespace std;

 const int maxn =  + ;

 int n;

 struct node

 {

     int r, d, w;

     bool operator <(const node& rhs) const

     {

         return d>rhs.d;     //右坐标越大的优先级越低

     }

 }a[maxn];

 bool cmp(node a, node b)

 {

     return a.r < b.r;

 }

 bool check(int speed)

 {

     priority_queue<node> q;

     int t = , cnt = ;

     while (cnt<n || !q.empty())

     {

         while (cnt < n && a[cnt].r == t)  q.push(a[cnt++]);

         int s = speed;

         while (!q.empty() && s!=)

         {

             node p = q.top();

             q.pop();

             int temp = min(s, p.w);

             s -= temp;

             p.w -= temp;

             if (p.w != )    q.push(p);

         }

         t++;

         if (!q.empty() && q.top().d == t)  return false;

         if (q.empty() && cnt == n)  return true;

     }

 }

 int main()

 {

     ios::sync_with_stdio(false);

     //freopen("D:\\txt.txt", "r", stdin);

     int T;

     cin >> T;

     while (T--)

     {

         cin >> n;

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

         {

             cin >> a[i].r >> a[i].d >> a[i].w;

         }

         sort(a, a + n, cmp);

         int left = , right = ;

         while (left <= right)

         {

             int mid = (left + right) / ;

             if (check(mid))  right = mid-;

             else  left = mid + ;

         }

         cout << left << endl;

     }

 }