#include <bits/stdc++.h>
#define ll long long
#define task ""
using namespace std;
const int maxn = 1e6 + 2, mod = 1e9 + 7;
int q, n, u, v, t, c[maxn], low[maxn], num[maxn], sccc, scc[maxn], id[maxn];
bool del[maxn], res[maxn], in_topo[maxn];
vector<int> l[maxn], adj_t[maxn], adj_g[maxn], new_adj[maxn], topo;
stack<int> st;
void init()
{
    for (int i = 1; i <= 4*n; i++)
    {
        scc[i] = id[i] = low[i] = num[i] = del[i] = res[i] = in_topo[i] = 0;
        adj_g[i].clear(); new_adj[i].clear();
    }
    t = 0; sccc = 0;
}
void add_edge (int u, bool fu, int v, bool fv)
{
    adj_g[u + (fu ? 2*n : 0)].push_back(v + (fv ? 0 : 2*n));
    adj_g[v + (fv ? 2*n : 0)].push_back(u + (fu ? 0 : 2*n));
}
void dfs (int u, int p)
{
    if (p == 0) add_edge(u, 1, u, 1);
    else add_edge(u, 0, p, 1);
    for (int v : adj_t[u])
    {
        if (v == p) continue;
        dfs(v, u);
    }
}
void tarjan (int u)
{
    low[u] = num[u] = ++t;
    st.push(u);
    for (int v : adj_g[u])
    {
        if (del[v]) continue;
        if (!num[v])
        {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else low[u] = min(low[u], num[v]);
    }
    if (low[u] == num[u])
    {
        sccc++;
        int v = 0;
        do
        {
            v = st.top();
            scc[v] = sccc;
            del[v] = true;
            st.pop();
        }
        while (v != u);
    }
}
void topo_sort (int u)
{
    in_topo[u] = true;
    for (int v : new_adj[u])
        if (!in_topo[v]) topo_sort(v);
    topo.push_back(u);
}
bool try_node (int u)
{
    init();
    for (int i = 1; i <= n; i++)
    {
        add_edge(l[i][0], 1, l[i][1], 1);
        add_edge(l[i][0], 0, l[i][1], 0);
    }
    dfs(u, 0);
    for (int i = 1; i <= 4*n; i++)
        if (!num[i]) tarjan(i);
    for (int i = 1; i <= 4*n; i++)
        for (int j : adj_g[i])
            new_adj[scc[i]].push_back(scc[j]);
    for (int i = 1; i <= sccc; i++)
        if (!in_topo[i]) topo_sort(i);
    reverse(topo.begin(), topo.end());
    for (int i = 0; i < (int)topo.size(); i++)
        id[topo[i]] = i;
    for (int i = 1; i <= 2*n; i++)
    {
        if (scc[i] == scc[i + 2*n]) return false;
        res[i] = id[scc[i]] > id[scc[i + 2*n]];
    }
    return true;
}
int main()
{
    //freopen(task".INP", "r", stdin);
    //freopen(task".OUT", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> q;
    while (q--)
    {
        cin >> n;
        for (int i = 1; i <= 2*n; i++)
        {
            adj_t[i].clear();
            l[i].clear();
        }
        for (int i = 1; i <= 2*n; i++)
        {
            cin >> c[i];
            l[c[i]].push_back(i);
        }
        for (int i = 1; i < 2*n; i++)
        {
            cin >> u >> v;
            adj_t[u].push_back(v);
            adj_t[v].push_back(u);
        }
        if (try_node(l[1][0]))
        {
            for (int i = 1; i <= 2*n; i++)
                if (res[i]) cout << i << " ";
        }
        else if (try_node(l[1][1]))
        {
            for (int i = 1; i <= 2*n; i++)
                if (res[i]) cout << i << " ";
        }
        else cout << -1;
        cout << '\n';
    }
}