#include<bits/stdc++.h>
using namespace std;
int t;
bool ok,e;
long long x[100005],y[100005];
unordered_map <int,int> fa;
int Findi(int x)
{
	if(fa[x]==x)
	{
		return x;
	}
	return fa[x]=Findi(fa[x]);
}
int Find(int x)
{
	if(fa.find(x)==fa.end())
	{
		fa.insert({x,x});
	}
	return Findi(x);
}
void Union(int x,int y)
{
	int a=Find(x);
	int b=Find(y);
	if(a!=b)
		fa[b]=a;
}
int main()
{
	cin>>t;
	while(t--)
	{
		int n,cnt=0;
		ok=true;
		memset(x,0,sizeof(x));
		memset(y,0,sizeof(y));
		cin>>n;
		for(int i=1;i<=n;i++)
		{
			cin>>x[cnt]>>y[cnt]>>e;
			cnt+=!e;
			if(e)
			{
				Union(x[cnt],y[cnt]);
			 } 
		}
		while(cnt--)
		{
			if(Find(x[cnt])==Find(y[cnt]))
			{
				cnt=(ok=false);
			}
		}
		if(ok)
		cout<<"YES"<<endl;
		else
		cout<<"NO"<<endl;
	}
	return 0;
}