#include <cstdio>
#include <iostream>
using namespace std;

const int maxn=100000+100;
int pre[maxn],ans[maxn];
int Find(int x)
{
    if(pre[x]!=x)
        pre[x]=Find(pre[x]);
    return pre[x];
}
int main()
{
    int T,i,j,n,a,b,c,x,cnt;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for (i=1;i<=n;i++)
        {
            pre[i]=i;
            ans[i]=0;
        }
        for (i=0;i<n-1;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            if(c==0)
            {
                pre[Find(a)]=pre[Find(b)];
            }
        }
        for (i=1;i<=n;i++)
        {
            ans[Find(i)]++;
        }
        int x=1;
        for (i=1;i<=n;i++)
        {
                if(ans[i]%2==1)
                {
                    cnt=i;
                    x=ans[i];
                    break;
                }
                else
                {
                    if (ans[i]!=0)
                    {
                        x=0;
                        cnt=i;
                        break;
                    }
                }
        }
        for (i=cnt+1;i<=n;i++)
        {
            if (ans[i]%2==1)
            {
                x=x^ans[i];
            }
            else
            {
                if (ans[i]!=0)
                x=0^x;
            }
        }
        if (n==0)
        cout<<0<<endl;
        else
        cout<<x<<endl;
        }

}