#include <bits/stdc++.h>

#define int ll
using ll = long long;

// #define MING_LE

const int inf = 1e18;
const int mod = 998244353;

using namespace std;

struct SCC
{
    vector<vector<int>> e;
    vector<int> siz;
    vector<int> scc;
    vector<int> dfn;
    vector<int> low;
    vector<bool> ins;
    stack<int> sck;
    int sccn;
    int id;
    int n;

    void dfs(int x)
    {
        ins[x] = 1;
        dfn[x] = ++id;
        low[x] = dfn[x];
        sck.push(x);

        for (auto it : e[x])
        {
            if (!dfn[it])
            {
                dfs(it);
                low[x] = min(low[x], low[it]);
            }
            else if (ins[it])
            {
                low[x] = min(low[x], dfn[it]);
            }
        }

        if (low[x] == dfn[x])
        {
            scc[x] = ++sccn;
            ins[x] = 0;
            siz[sccn] = 1;
            while (sck.top() != x)
            {
                scc[sck.top()] = sccn;
                ins[sck.top()] = 0;
                siz[sccn]++;
                sck.pop();
            }
            sck.pop();
        }
    }

    SCC(vector<vector<int>> &a, int len)
    {
        e = a;
        siz.resize(len + 5);
        scc.resize(len + 5);
        dfn.resize(len + 5);
        low.resize(len + 5);
        ins.resize(len + 5);
        n = len;
        sccn = 0;
        while (!sck.empty())
            sck.pop();
    }

    SCC(int len)
    {
        e.resize(len + 5);
        siz.resize(len + 5);
        scc.resize(len + 5);
        dfn.resize(len + 5);
        low.resize(len + 5);
        ins.resize(len + 5);
        n = len;
        id = 0;
        sccn = 0;
        while (!sck.empty())
            sck.pop();
    }

    SCC() {}

    void addedge(int from, int to)
    {
        e[from].push_back(to);
    }

    void GetScc()
    {
        for (int i = 1; i <= n; i++)
        {
            if (!dfn[i])
                dfs(i);
        }
    }
};

int n;
void dfs(int x, int fa, SCC &graph);
vector<int> a[200010];
pair<int, int> cor[100010];
int ch[200010];

void solve();

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int __ = 1;
    cin >> __;

    while (__--)
        solve();

    return 0;
}

void solve()
{
    cin >> n;
    for (int i = 1; i <= 2 * n; i++)
    {
        a[i].clear();
        ch[i] = 0;
        cor[i] = make_pair(0, 0);
    }
    SCC graph(n * 4);
    for (int i = 1; i <= 2 * n; i++)
    {
        int c;
        cin >> c;
        ch[i] = c;
        if (cor[c].first == 0)
            cor[c].first = i;
        else
            cor[c].second = i;
    }
    for (int i = 1; i <= 2 * n - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        a[u].push_back(v);
        a[v].push_back(u);
    }

    for (int i = 2; i <= n; i++)
    {
        graph.addedge(cor[i].first, cor[i].second + 2 * n);
        graph.addedge(cor[i].first + 2 * n, cor[i].second);
        graph.addedge(cor[i].second, cor[i].first + 2 * n);
        graph.addedge(cor[i].second + 2 * n, cor[i].first);
    }

    SCC now;
    now = graph;

    now.addedge(cor[1].first + 2 * n, cor[1].first);
    now.addedge(cor[1].second, cor[1].second + 2 * n);
    dfs(cor[1].first, 0, now);
    now.GetScc();

    bool flag = 1;
    for (int i = 1; i <= 2 * n; i++)
    {
        if (now.scc[i] == now.scc[i + 2 * n])
        {
            flag = 0;
            break;
        }
    }
    if (flag)
    {
        vector<int> res;
        res.clear();
        for (int i = 1; i <= 2 * n; i++)
        {
            if (now.scc[i] < now.scc[i + 2 * n])
                res.push_back(i);
        }

        // cout << "YES\n";
        for (auto it : res)
            cout << it << " ";
        cout << '\n';
        return;
    }

    now = graph;
    swap(cor[1].first, cor[1].second);

    now.addedge(cor[1].first + 2 * n, cor[1].first);
    now.addedge(cor[1].second, cor[1].second + 2 * n);
    dfs(cor[1].first, 0, now);
    now.GetScc();

    flag = 1;
    for (int i = 1; i <= 2 * n; i++)
    {
        if (now.scc[i] == now.scc[i + 2 * n])
        {
            flag = 0;
            break;
        }
    }
    if (flag)
    {
        vector<int> res;
        res.clear();
        for (int i = 1; i <= 2 * n; i++)
        {
            if (now.scc[i] < now.scc[i + 2 * n])
                res.push_back(i);
        }

        // cout << "YES\n";
        for (auto it : res)
            cout << it << " ";
        cout << '\n';
        return;
    }

    cout << "-1\n";
}

void dfs(int x, int fa, SCC &graph)
{

    for (auto it : a[x])
    {
        if (fa == it)
            continue;
        graph.addedge(it, x);
        graph.addedge(x + 2 * n, it + 2 * n);
        // if (ch[it] == ch[x])
        //     continue;

        dfs(it, x, graph);
    }
}