#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;

int cnt[100010], fa[100010];

int findfa(int x) {
    return (x == fa[x])? x: (fa[x] = findfa(fa[x]));
}

int main(void) {
    int T;
    scanf("%d", &T);
    while (T -- > 0) {
        int n;
        scanf("%d", &n);
        for (int i = 1; i <= n; ++ i) {
            fa[i] = i; cnt[i] = 1;
        }
        for (int i = 1; i < n; ++ i) {
            int u, v, w;
            scanf("%d %d %d", &u, &v, &w);
            if (w == 1) continue;
            int x = findfa(u), y = findfa(v);
            if (x != y) {
                if (cnt[x] <= cnt[y]) {
                    cnt[y] += cnt[x];
                    fa[x] = y;
                } else {
                    cnt[x] += cnt[y];
                    fa[y] = x;
                }
            }
        }
        int ans = 0;
        for (int i = 1; i <= n; ++ i) {
            int f = findfa(i);
            ans ^= cnt[f];
        }
        printf("%d\n", ans);
    }

    return 0;
}