#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std; 
struct DisjoinSet{
    std::vector<int> father,rank,size;
    DisjoinSet(int n) : father(n),rank(n),size(n) {
        for(int i=0;i<n;i++)
        father[i]=i,size[i]=1;
    }
    int find(int v){
        return father[v]=(father[v]==v)?v:find(father[v]);
    }
    void merge(int x,int y){
        int a=find(x),b=find(y);
        if(rank[a]<rank[b])
        father[a]=b,size[b]+=size[a];
        else{
            father[b]=a;
            size[a]+=size[b];
            if(rank[b]==rank[a])
            ++rank[a];
        }
    }
};
int n;
int a,b,flag;
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        cin>>n;
        DisjoinSet tmp=DisjoinSet(n);
        int num=n-1;
        while(num--)
        {
            scanf("%d%d%d",&a,&b,&flag);
            if(!flag)
            tmp.merge(a-1,b-1);
        }
        int ans=0;
        for(int i=0;i<n;i++)
        ans^=tmp.size[tmp.find(i)];
        cout<<ans<<endl; 
    }
}