#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn=100010;

int fa[maxn],size[maxn];

int getf(int x){
        if(fa[x]!=x) return fa[x]=getf(fa[x]);
        return x;
}

void work(){
        int n;
        scanf("%d",&n);
        for(int i=1; i<=n; ++i)
                fa[i]=i,size[i]=1;
        int u,v,w;
        for(int i=1; i<n; ++i){
                scanf("%d%d%d",&u,&v,&w);
                if(!w){
                        int x=getf(u),y=getf(v);
                        fa[x]=y;
                        size[y]+=size[x];
                }
        }
        int ans=0;
        for(int i=1; i<=n; ++i)
                ans^=size[getf(i)];
        printf("%d\n",ans);
}

int main(){
        int kase;
        scanf("%d",&kase);
        while(kase--) work();
        return 0;
}