#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int T,n,a,b,c,fa,fb,ans,i,f[101000],g[101000];
int findfa(int o){
    if(o==f[o])return o;
    return f[o]=findfa(f[o]);
}
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(i=1;i<=n;++i)f[i]=i,g[i]=1;
        for(i=1;i<n;++i){
            scanf("%d%d%d",&a,&b,&c);
            if(c)continue;
            fa=findfa(a);
            fb=findfa(b);
            f[fb]=fa;
            g[fa]+=g[fb];
        }
        ans=0;
        for(i=1;i<=n;++i){
            fa=findfa(i);ans^=g[fa];
        }
        printf("%d\n",ans);
    }
    return 0;
}