全wa求助

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll T,n,x[100001],y[100001],e[100001],t[200001],cnt,fa[200001]; 
ll get(ll x){return lower_bound(t+1,t+cnt+1,x)-t;}
ll find(ll x){
	if (fa[x]==x) return x;
	else return fa[x]=find(fa[x]);
}
void merge(ll x,ll y){
	fa[find(x)]=find(y);
}
int main(){
	cin>>T;
	while (T--){
		memset(fa,0,sizeof(fa)); 
		for (ll i=1;i<=2*n;i++) fa[i]=i;
		cin>>n;
		for (ll i=1;i<=n;i++){
			cin>>x[i]>>y[i]>>e[i];
			t[i*2-1]=x[i];
			t[i*2]=y[i];
		}
		sort(t+1,t+2*n+1);
		cnt=unique(t+1,t+2*n+1)-t-1;
		for (ll i=1;i<=n;i++){
			ll xx=get(x[i]),yy=get(y[i]);
			if (e[i]==0) merge(xx,yy);
			else if (find(xx)==find(yy)){
				cout<<"NO\n";
				goto x; 
			}
		} 
		cout<<"YES\n";
		x:
			continue;
			;
	}
}