#include <cstdio>
#include <vector>

const int N = 200000;
int n, t, c[N];
std::vector<int> g[N];
int dep[N], cnt[N];

void dfs(int v, int pr = -1) {
	++cnt[dep[v]];
	for (int i = 0; i < (int)g[v].size(); ++i) if (g[v][i] != pr) {
		dep[g[v][i]] = dep[v] + 1;
		c[g[v][i]] = !c[v];
		dfs(g[v][i], v);
	}
}

int main() {
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		for (int i = 1; i < 2 * n; ++i) {
			int a, b;
			scanf("%d%d", &a, &b);
			--a;
			--b;
			g[a].push_back(b);
			g[b].push_back(a);
		}
		dfs(0);
		int bal = 0;
		for (int i = 0; i < 2 * n; ++i) {
			if (i & 1) bal += cnt[i];
			else bal -= cnt[i];
		}
		int start;
		if (bal > 0) start = 1;
		else {
			start = 0;
			bal = -bal;
		}
		int mx = 0, ind = 0;
		for (int i = start; i < 2 * n; i += 2) {
			if (cnt[i] > mx) {
				mx = cnt[i];
				ind = i;
			}
		}
		for (int i = 0; i < 2 * n; ++i) if (dep[i] == ind && bal) {
			bal -= 2;
			c[i] = !c[i];
		}
		for (int i = 0; i < 2 * n; ++i) {
			printf("%d ", c[i]);
			c[i] = 0;
			dep[i] = 0;
			cnt[i] = 0;
			g[i].clear();
		}
		printf("\n");
	}
	return 0;
}