#include<stdio.h>
#include<algorithm>
using namespace std;
struct room {
	int a;  
	int b;  
	int c;  
};
bool cmp(room p, room q) {
	return p.b < q.b;
}
int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		int n;
		scanf("%d", &n);
		room s[n + 10];		
		for (int i = 0; i < n; i++) {
			scanf("%d%d%d", &s[i].a, &s[i].b, &s[i].c);
		}		
		sort(s, s + n, cmp);   		
		int max = -1000;
		int arr[200] = {0}; 
		for (int i = 0; i < n; i++) {
			for (int j = s[i].b; j < s[i].b + s[i].c; j++) {
				arr[j] += s[i].a;
				if (arr[j] > max) {
					max = arr[j];
				}
			}
		}		
		printf("%d\n", max);
	}
	return 0;
}