#include<algorithm>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
int t,k,n,m,tp,sum,fa[100005],ans[100005],u,v,w,f1,f2;
int get(int k){
    if(k==fa[k])return k;return fa[k]=get(fa[k]);
}
int main(){
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);sum=0;memset(ans,0,sizeof(ans));
        for(int i=1;i<=n;++i)fa[i]=i;
        for(int i=1;i<n;++i){
            scanf("%d%d%d",&u,&v,&w);
            if(w==0){
                f1=get(u);f2=get(v);fa[f1]=f2;
            }
        }
        for(int i=1;i<=n;++i){ans[get(i)]++;}
        for(int i=1;i<=n;++i)sum^=ans[fa[i]];
        printf("%d\n",sum);
    }
    return 0;
}