#include <bits/stdc++.h>

using namespace std;

typedef vector <int> vi;

const int MAX_N = 400000 + 5;
const int MAX_M = MAX_N * 12;

int N, c[MAX_N], node[MAX_N][2];
vi edge[MAX_N];
struct Edge{
    int y, prev;
}e[MAX_M];
int elast[MAX_N], ecnt;
int low[MAX_N], dfsn[MAX_N], Tm;
int sta[MAX_N], tp, scc[MAX_N], scc_cnt;
bool vis[MAX_N];

void Build(int x, int y) {
    ecnt ++;
    e[ecnt].y = y;
    e[ecnt].prev = elast[x];
    elast[x] = ecnt;
}

void tarjan(int u) {
    dfsn[u] = low[u] = ++ Tm;
    sta[++ tp] = u; vis[u] = 1;
    for (int i = elast[u]; i; i = e[i].prev) {
        int v = e[i].y;
        if (!dfsn[v]) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }else if (vis[v]) low[u] = min(low[u], dfsn[v]);
    }
    if (dfsn[u] == low[u]) {
        scc_cnt ++;
        while (sta[tp] != u) {
            scc[sta[tp]] = scc_cnt;
            vis[sta[tp --]] = 0;
        }
        scc[sta[tp]] = scc_cnt;
        vis[sta[tp --]] = 0;
    }
}

void dfs(int u, int fa) {
    for (auto v : edge[u]) {
        if (v != fa) {
            // !v || u
            Build(v, u);
            Build(u + (N << 1), v + (N << 1));
            dfs(v, u);
        }
    }
}

vi solve(int rt) {
    ecnt = 0; Tm = 0; scc_cnt = 0;
    memset(elast, 0, sizeof(int) * (N << 2 | 1));
    
    dfs(rt, 0);
    for (int i = 1; i <= N; i ++) {
        int u = node[i][0], v = node[i][1];
        // u ^ v -> (u || v) && (!u || !v)
        Build(u + (N << 1), v);
        Build(v + (N << 1), u);
        Build(u, v + (N << 1));
        Build(v, u + (N << 1));
    }
    for (int i = 1; i <= (N << 2); i ++) {
        if (!dfsn[i]) tarjan(i);
    }
    vi res(0);
    for (int i = 1; i <= (N << 1); i ++) {
        int u = i, v = i + (N << 1);
        if (scc[u] == scc[v]) {
            res.clear();
            return res;
        }else if (scc[u] < scc[v]) res.push_back(i);
    }
    return res;
}

void solve() {
    cin >> N;
    for (int i = 1; i <= N; i ++) node[i][0] = 0;
    for (int i = 1; i <= (N << 1); i ++) {
        cin >> c[i]; edge[i].clear();
        node[c[i]][node[c[i]][0] != 0] = i;
    }
    for (int i = 1; i < (N << 1); i ++) {
        int x, y;
        cin >> x >> y;
        edge[x].push_back(y);
        edge[y].push_back(x);
    }
    vi res = solve(node[1][0]);
    if (res.empty()) res = solve(node[1][1]);
    if (res.empty()) cout << "-1\n";
    else {
        for (auto x : res) cout << x << ' ';
        cout << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int T; cin >> T;
    while (T --) solve();
    
    return 0;
}