80pts求调wa on#7、10

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+1;
ll T,n,t[2*N],cnt,fa[2*N];
struct node{ll x,y,e;}a[N]; 
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);}
bool cmp(node x,node y){return x.e>y.e;}
int main(){
	cin>>T;
	while (T--){
		ll flag=1;
		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>>a[i].x>>a[i].y>>a[i].e;
			t[i*2-1]=a[i].x;
			t[i*2]=a[i].y;
		}
		sort(t+1,t+2*n+1);
		cnt=unique(t+1,t+2*n+1)-t-1;
		sort(a+1,a+n+1,cmp);
		for (ll i=1;i<=n;i++){
			ll xx=get(a[i].x),yy=get(a[i].y);
			if (a[i].e==1) merge(xx,yy);
			else if (find(xx)==find(yy)){
				flag=0;
				break;
			}
		} 
		if (flag==1) cout<<"YES\n";
		else cout<<"NO\n";
	}
}