60分WA求dalao调试！

$\colorbox{green}{\color{white}{\#1AC}}- \colorbox{red}{\color{white}{\#2WA}}-\colorbox{red}{\color{white}{\#3WA}}-\colorbox{green}{\color{white}{\#4AC}}-\colorbox{green}{\color{white}{\#5AC}}-\colorbox{green}{\color{white}{\#6AC}}-\colorbox{green}{\color{white}{\#7AC}}-\colorbox{green}{\color{white}{\#8AC}}-\colorbox{red}{\color{white}{\#9WA}}-\colorbox{red}{\color{white}{\#10WA}}$

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n=200000,k,op[200010],x[200010],y[200010],t,ans=0;
int fa[1000010];
vector<int>a;
int find(int r){return fa[r]==r?r:fa[r]=find(fa[r]);}
void merge(int u,int v){int fx=find(u),fy=find(v);if(fx!=fy)fa[fx]=fy;}
signed Main();
signed main(){scanf("%lld",&t);while(t--)Main();return 0;}
signed Main()
{
	scanf("%lld",&k);
	for(int i=1;i<=1000000;i++)fa[i]=i;
	bool p=1;
	for(int i=0;i<k;i++)
	{
		scanf("%lld %lld %lld",&x[i],&y[i],&op[i]);
		a.push_back(x[i]);
		a.push_back(y[i]);
	}
	sort(a.begin(),a.end());
	for(int i=0;i<k;i++)
	{
		x[i]=lower_bound(a.begin(),a.end(),x[i])-a.begin();
		y[i]=lower_bound(a.begin(),a.end(),y[i])-a.begin();
	}
	for(int i=0;i<k;i++)
	{
		if(op[i]==1)
		{
			if(find(x[i])==find(y[i]+n))
			{
				p=0;
				printf("NO\n");
				break;
			}
			else merge(x[i],y[i]),merge(x[i]+n,y[i]+n);
		}
		else
		{
			if(find(x[i])==find(y[i]))
			{
				p=0;
				printf("NO\n");
				break;
			}
			else merge(x[i],y[i]+n),merge(x[i]+n,y[i]);
		}
	}
	if(p)printf("YES\n");
	return 0;
}