#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define INF 0x3f3f3f3
const int N=100005;

int f[N];
int s[N];

int dsu(int u){
    return u==f[u]? u:f[u]=dsu(f[u]);
}

int main()
{
    int t,u,v,w,n;
    cin>>t;
    while (t--) {
        memset(f, 0, sizeof(f));
        memset(s, 0, sizeof(s));
        cin>>n;
        for (int i=0; i<n; i++) {
            f[i]=i;
        }
        for (int i=0; i<n-1; i++) {
            scanf("%d%d%d",&u,&v,&w);
            if (w==0) {
                int _u=dsu(u),_v=dsu(v);
                if (_u!=_v) {
                    f[v]=_u;
                }
            }
        }
        for (int i=1; i<=n; i++) {
            dsu(i);
        }
        for (int i=1; i<=n; i++) {
            f[i]++;
        }
        for (int i=1; i<=n; i++) {
            s[f[i]+1]++;
        }
        int sum=0;
        for (int i=1; i<=n; i++) {
            sum=sum^s[f[i]+1];
        }
        cout<<sum<<endl;
    }
    return 0;
}