#include <iostream>
using namespace std;
const int N = 15;
int t, n, num, idx;
int T[N], D[N], L[N],q[N];
bool st[N];
void dfs(int x)
{
	if (x > n)
	{
		
		for (int i = 1; i <= n; i ++ )
		{
			if (i == 1) num = T[q[i]] + L[q[i]];
			else
			{
				
				if (num > T[q[i]] + D[q[i]]) return ;
				num += L[q[i]]; 
			}
		}
		idx ++ ;
		return ;
	}
	
	for (int i = 1; i <= n; i ++ )
	{
		if (!st[i])
		{		 
			q[x] = i;
			st[i] = true;			
			dfs(x + 1);
			st[i] = false;
		}
	}
	return ;
}
int main()
{
	cin >> t;
	while (t -- )
	{
		idx = 0;
		num = 0;
		cin >> n;
		for (int i = 1; i <= n; i ++ ) cin >> T[i] >> D[i] >> L[i];
		dfs(1);
		
		if (idx >= 1) cout << "YES";
		else cout << "NO";
		cout << endl;
	}
	return 0;
}