#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
using namespace std;
constexpr int MAXN{200010};

vector<int> g[MAXN];
int oddd_cnt, leaves[2];
int cnd[2];
bool ans[MAXN];

void dfs0(int n, int p, int d)
{
	ans[n] = d & 1;
	oddd_cnt += d & 1;
	if (g[n].size() == 1)
		leaves[d & 1]++;
	else
		cnd[d & 1] = n;
	for (int a : g[n])
		if (a != p)
			dfs0(a, n, d + 1);
}

int r;
void dfs1(int n, int p)
{
	if (r == 0)
		return;
	if (g[n].size() == 1)
	{
		ans[n] ^= 1;
		r--;
		if (r == 0)
			return;
	}
	for (int a : g[n])
		if (a != p)
			dfs1(a, n);
}

void solve()
{
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= 2 * n; i++)
		g[i].clear();
	for (int i = 0, u, v; i < 2 * n - 1; i++)
	{
		scanf("%d %d", &u, &v);
		g[u].push_back(v);
		g[v].push_back(u);
	}
	oddd_cnt = leaves[0] = leaves[1] = 0;
	cnd[0] = cnd[1] = -1;
	dfs0(1, -1, 0);
	bool fail{false};
	if (oddd_cnt != n)
	{
		bool mfc{oddd_cnt > n};
		r = abs(oddd_cnt - n);
		if (leaves[mfc] >= r)
			dfs1(1, -1);
		else
			exit(1);
	}
	if (fail)
		printf("-1\n");
	else
	{
		for (int i = 1; i <= 2 * n; i++)
			printf("%d ", ans[i]);
		printf("\n");
	}
}

int main()
{
	int T;
	scanf("%d", &T);
	while (T--)
		solve();
	return 0;
}