#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
using namespace std;
#define maxn 100010
#define eps 1e-6

vector<int> heads[maxn];
bool visited[maxn];
int n;
void dfs(int root, int& cnt)
{
    visited[root]=true;
    cnt++;
    int i, u;
    for(i=0;i<heads[root].size();i++)
    {
    u=heads[root][i];
    if(!visited[u])
        dfs(u, cnt);
    }
    
}
int gao()
{
    int cnt, ans=0, i;
    for(i=0; i<n; i++)
    {
    cnt=0;
    if(!visited[i])
        dfs(i, cnt);
    if(cnt%2)
            ans^=cnt;
    }
    return ans;
}

int main()
{
    int i, T, u, v, ans;
    double w;
    scanf("%d",&T);
    while(T--)
    {
       scanf("%d",&n);
       memset(visited, false, sizeof(visited));
       for(i=0;i<n;i++)
       heads[i].clear();
       for(i=0;i<n-1;i++)
       {
       scanf("%d%d%lf",&u, &v, &w);
       if(fabs(w)<eps)
       {
           heads[u-1].push_back(v-1);
           heads[v-1].push_back(u-1);
       }
       }
       ans=gao();
       printf("%d\n",ans);
    }
    return 0;
}