#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<stack>
#define mod 1000000007
#define INF 1000000000000000000LL
#define N 1005
#define M 100005
#define eps 1e-9
#define LL long long
using namespace std;
struct node{
    int to,v;
};
vector<node>edge[M];
int dp[M];
void dfs(int x,int fa){
    dp[x]=1;
    int j,k;
    for(j=0;j<edge[x].size();j++){
        int to=edge[x][j].to;
        if(to==fa) continue;
        dfs(to,x);
        if(edge[x][j].v==0) dp[x]+=dp[to];
    }
}
void dfs1(int x,int fa){
    int j,k;
    for(j=0;j<edge[x].size();j++){
        int to=edge[x][j].to;
        if(to==fa) continue;
        if(edge[x][j].v==0) dp[to]=dp[x];
        dfs1(to,x);
    }
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        int j,k;
        for(j=1;j<=n;j++) edge[j].clear();
        for(j=1;j<n;j++){
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            edge[a].push_back((node){b,c});
            edge[b].push_back((node){a,c});
        }
        dfs(1,0);
        dfs1(1,0);
        int ans=0;
        for(j=1;j<=n;j++){
            ans^=dp[j];
            //printf("%d\n",dp[j]);
        }
        printf("%d\n",ans);
    }
    //system("pause");
    return 0;
}