#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<stack>
#include<queue>
using namespace std;
typedef int ll;
typedef double db;
typedef unsigned long long ull;
const int maxn=1000005;
const int maxm=1e6+10;
const ll mod=1e9+7;
const ull base1=19260817;
const ull base2=19660813;
const ll maxxn=0x7fffffff;
const ll minxn=-0x7fffffff;
const db inf=1e13;
inline ll read(){
    ll x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}
ll t,n;
ll fa[maxn],tot[maxn*2],cnt;
struct edge{
    ll from,to,ope;
}e[maxn];
inline ll find(ll x){
    if(fa[x]!=x) fa[x]=find(fa[x]);
    return fa[x];
}
inline bool cmp(edge x,edge y){
    return x.ope>y.ope;
}
int main(){
    t=read();
    while(t--){
        n=read();
        bool pd=true;
        memset(tot,0,sizeof(cnt));
        memset(fa,0,sizeof(fa));
        memset(e,0,sizeof(e));
        for(int i=1;i<=n;i++){
            //e[i].from=read(),e[i].to=read(),e[i].ope=read();
            scanf("%d%d%d",&e[i].from,&e[i].to,&e[i].ope);
            tot[++cnt]=e[i].from;
            tot[++cnt]=e[i].to;
        }
        sort(tot+1,tot+1+cnt);
        ll len=unique(tot+1,tot+1+cnt)-tot;
        for(int i=1;i<=n;i++){
            e[i].from=lower_bound(tot+1,tot+1+len,e[i].from)-tot;
            e[i].to=lower_bound(tot+1,tot+1+len,e[i].to)-tot;
        }
        for(int i=1;i<=len;i++){
            fa[i]=i;
        }
        sort(e+1,e+1+n,cmp);
        for(int i=1;i<=n;i++){
            ll fu=find(e[i].from),fv=find(e[i].to);
            if(e[i].ope){
                fa[fu]=fv;
            }
            else{
                if(fu==fv){
                    printf("NO\n");
                    pd=false;
                    break;
                }
            }  
        }
        if(pd) printf("YES\n");
    }
    return 0;
}