#include <cstdio>

#include <cstring>

#include <vector>

using namespace std;

typedef long long ll;

const int N = 1e5 + 5;

const int INF = 0x3f3f3f3f;

struct DSU	{

	int rt[N], sz[N];

	void clear(void)	{

		memset (rt, -1, sizeof (rt));

		memset (sz, 0, sizeof (sz));

	}

	int Find(int x)	{

		return rt[x] == -1 ? x : rt[x] = Find (rt[x]);

	}

	void Union(int x, int y)	{

		x = Find (x);	y = Find (y);

		if (x == y)	return ;

		rt[y] = x;

		sz[x] += sz[y] + 1;

	}

}dsu;

int n;

int main(void)  {

    int T;  scanf ("%d", &T);

    while (T--) {

		dsu.clear ();

        scanf ("%d", &n);

        for (int u, v, w, i=1; i<n; ++i)   {

            scanf ("%d%d%d", &u, &v, &w);

            if (!w)	{

				dsu.Union (u, v);

			}

        }

		int ans = 0;

		for (int i=1; i<=n; ++i)	{

			ans ^= (dsu.sz[dsu.Find (i)] + 1);

		}

        printf ("%d\n", ans);

    }

    return 0;

}