#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
typedef __int64 ll;
const int maxn = 1e5+5;
const int inf = 0x3f3f3f3f;
int dp[maxn], SET[maxn];
vector<int>vv[maxn];
int findx(int r)
{
    if(r==SET[r]) return r;
    return SET[r] = findx(SET[r]);
}
void Merge(int x,int y)
{
    int fx = findx(x);
    int fy = findx(y);
    SET[fx] = fy;
}
int main()
{
    int T, n, u, v, w;
    cin>>T;
    while(T--)
    {
        scanf("%d",&n);
        memset(dp,0,sizeof dp);
        for(int i = 0; i < n; i++) {
            SET[i] = i;
            vv[i].clear();
        }
        for(int i = 0; i < n-1; i++){
            scanf("%d%d%d",&u,&v,&w);
            if(w==0){
                Merge(u-1,v-1);
            }
        }
        for(int i = 0; i< n; i++){
            vv[findx(i)].push_back(i);
        }
        for(int i = 0; i < n; i++){
            int len = vv[i].size();
            if(len){
                for(int j = 0; j < len; j++){
                    dp[vv[i][j]] += len-1;
                }
            }
        }
        ll ans = 0;
        for(int i = 0; i < n; i++){
            dp[i]++;
            ans^=dp[i];
        }
        printf("%I64d\n",ans);
    }
    return 0;
}