#include<bits/stdc++.h>
using namespace std;
int main(){
	int t;
	cin>>t;
	while(t--){
		long int n,mn=INT_MAX,mx=INT_MIN,l,r,sp;
		cin>>n;
	//	vector <long int> l(n,0),r(n,0),sp(n,0);
		int i;
		vector <pair <long int,pair <long int,long int> > > v; 
	 
		for(i=0;i<n;i++){
			cin>>l>>r>>sp;
			v.push_back(make_pair(sp,make_pair(l,r)));
		}
		sort(v.begin(),v.end());
		for(i=0;i<n;i++){
			if((i+2)<n && v[i].first==v[i+1].first && v[i].first==v[i+2].first){
					mn=max(v[i].second.first,v[i+1].second.first);
					mx=min(v[i].second.second,v[i+1].second.second);
					if((v[i+2].second.first>=mn && v[i+2].second.first<=mx) || (v[i+2].second.second>=mn && v[i+2].second.second<=mx)){
						cout<<"NO"<<endl;
						break;
					}
			}
		}
		if(i==n){
			cout<<"YES"<<endl;
		}
	}
	return 0;
}