#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <ctime>
using namespace std;
const int MAXN=200005;

int T,n,r1,r2;
int fa[MAXN],Tmp[MAXN][2];
map<int,int>M;

inline int Find(int x){
	if(x!=fa[x])fa[x]=Find(fa[x]);
	return fa[x];
}

int main(){
	freopen("prog.in","r",stdin);
	freopen("prog.out","w",stdout);
	scanf("%d",&T);
	for(int i=1;i<=200003;i++)fa[i]=i;
	while(T--){
		scanf("%d",&n);
		int a,b,c,tot=0,sum=0;
		bool bo=false;
		for(int i=1;i<=n;i++){
			scanf("%d%d%d",&a,&b,&c);
			if(!M.count(a))
				M[a]=++tot;
			if(!M.count(b))
				M[b]=++tot;
			if(c == 1){
				r1=Find(M[a]); r2=Find(M[b]);
				if(r1!=r2)fa[r2]=r1;
			}
			else{
				Tmp[++sum][0]=a; Tmp[sum][1]=b;
			}
		}
		for(int i=1;i<=sum;i++){
			r1=Find(M[Tmp[i][0]]); r2=Find(M[Tmp[i][1]]);
			if(r1==r2){
				bo=true; break;
			}
		}
		if(bo)puts("NO");
		else puts("YES");
		for(int i=1;i<=tot;i++)fa[i]=i;
		M.clear();
	}
	return 0;
}