#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

// #define Debug
// #define LOCAL
#define TestCases

const int N = 1e5, M = N << 1;
const int SZ = M << 1;

int n, m;

int col[M + 5];
vector<int> vec[N + 5];

vector<int> e[M + 5];

namespace Checker
{
	vector<int> g[SZ + 5];

	void build(int u, int fa)
	{
		int c = col[u];
		int other = vec[c][0] + vec[c][1] - u;

		g[u].push_back(other + m);//choose u1 <=> not choose u2
		g[other + m].push_back(u);

		if (fa)
		{
			g[u].push_back(fa);//choose u => choose fa
			g[fa + m].push_back(u + m);//not choose fa => not choose u
		}

		for (auto v : e[u])
		{
			if (v != fa)
				build(v, u);
		}
		return ;
	}

	int dfn[SZ + 5], low[SZ + 5], tim;
	int stk[SZ + 5], top;
	int scc[SZ + 5], cnt;

	void tarjan(int u)
	{
		dfn[u] = low[u] = ++tim;
		stk[++top] = u;

		for (auto v : g[u])
		{
			if (!dfn[v])
			{
				tarjan(v);
				low[u] = min(low[u], low[v]);
			}
			else if (!scc[v])
				low[u] = min(low[u], dfn[v]);
			else
				{;}
		}

		if (dfn[u] == low[u])
		{
			cnt++;
			while (stk[top] != u)
			{
				scc[ stk[top] ] = cnt;
				top--;
			}
			scc[u] = cnt;
			top--;
		}
		return ;
	}

	void clr()
	{
		for (int i = 1; i <= m + m; i++)
		{
			g[i].clear();
			dfn[i] = scc[i] = 0;//dfn !!!
		}
		tim = cnt = top = 0;
		return ;
	}

	bool check(int root)
	{
		clr();
		build(root, 0);
		
		for (int i = 1; i <= m + m; i++)
		{
			if (!dfn[i])
				tarjan(i);
		}

		for (int i = 1; i <= m; i++)
		{
			if (scc[i] == scc[i + m])
				return false;
		}

		for (int i = 1; i <= m; i++)
		{
			if (scc[i] < scc[i + m])
				printf("%d ", i);
		}
		printf("\n");
		return true;
	}
}

void clr()
{
	for (int i = 1; i <= n; i++)
	{
		vec[i].clear();
	}
	for (int i = 1; i <= m; i++)
	{
		e[i].clear();
	}
	return ;
}

void solve()
{
	scanf("%d", &n);
	m = n << 1;

	for (int i = 1; i <= m; i++)
	{
		scanf("%d", col + i);
		vec[col[i]].push_back(i);
	}

	for (int i = 1, u, v; i < m; i++)
	{
		scanf("%d%d", &u, &v);
		e[u].push_back(v);
		e[v].push_back(u);
	}

	if (!Checker :: check(vec[1][0]))
	{
		if (!Checker :: check(vec[1][1]))
			puts("-1");
	}
	clr();
	return ;
}

int main()
{
	#ifdef LOCAL
	freopen("data.in", "r", stdin);
	freopen("mycode.out", "w", stdout);
	#endif
	
	int T = 1;
	
	#ifdef TestCases
	scanf("%d", &T);
	#endif
	
	while (T--)
		solve();
	return 0;
}