#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout (T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 2e5 + 5;

int n;
int a[SIZE];
vector<int> adj[SIZE];
pair<int, int> p[SIZE];

int pa[SIZE], rev[SIZE];
vector<int> g[SIZE];

struct SCC {
    int n, dfcnt = 0, sccnt = 0;
    vector<int> dfn, low, scc, st, ist;
    vector<vector<int>> scc_adj;
    SCC() {}
    SCC(int n) : n(n) {
        dfn = low = scc = ist = vector<int>(n + 1, 0);
        scc_adj = vector<vector<int>>(n + 1, vector<int>());
    }
    void tarjan(int pos) {
        dfn[pos] = low[pos] = ++dfcnt;
        st.emplace_back(pos);
        ist[pos] = 1;
        for (int np : g[pos]) {
            if (dfn[np] == 0) {
                tarjan(np);
                low[pos] = min(low[pos], low[np]);
            } else if (ist[np] == 1) {
                low[pos] = min(low[pos], dfn[np]);
            }
        }
        if (dfn[pos] == low[pos]) {
            sccnt++;
            while (1) {
                int x = st.back();
                ist[x] = 0;
                scc[x] = sccnt;
                st.pop_back();
                if (x == pos) {
                    break;
                }
            }
        }
    }
    void work() {
        for (int i = 1; i <= n; i++) {
            if (dfn[i] == 0) {
                tarjan(i);
            }
        }
    }
    void build_adj() {
        for (int i = 1; i <= n; i++) {
            for (int j : g[i]) {
                if (scc[i] != scc[j]) {
                    scc_adj[scc[i]].emplace_back(scc[j]);
                }
            }
        }
    }
} scc;

bool work(int root) {
    FOR (i, 1, 2 * n) {
        g[i].clear();
        g[rev[i]].clear();
    }
    {
        pa[root] = 0;
        queue<pair<int, int>> q;
        q.emplace(root, root);
        while (q.size()) {
            auto [pos, fa] = q.front();
            q.pop();
            for (int np : adj[pos]) if (np != fa) {
                pa[np] = pos;
                q.emplace(np, pos);
            }
        }
    }
    FOR (i, 1, 2 * n) if (pa[i]) {
        g[i].pb(pa[i]);
        g[rev[pa[i]]].pb(rev[i]);
    }
    scc = SCC(2 * n);
    scc.work();
    if (scc.scc[root] > scc.scc[rev[root]]) return 0;
    FOR (i, 1, n) {
        auto [a, b] = p[i];
        if (scc.scc[a] == scc.scc[b]) return 0;
    }
    FOR (i, 1, n) {
        auto [a, b] = p[i];
        cout << (scc.scc[a] < scc.scc[b] ? a : b) << " \n"[i == n];
    }
    return 1;
}

void solve() {
    cin >> n;
    FOR (i, 1, n) {
        p[i] = {0, 0};
        adj[i].clear(), adj[n + i].clear();
    }
    FOR (i, 1, 2 * n) {
        cin >> a[i];
        (p[a[i]].F ? p[a[i]].S : p[a[i]].F) = i;
    }
    FOR (i, 1, n) {
        auto [a, b] = p[i];
        rev[a] = b, rev[b] = a;
    }
    FOR (i, 2, 2 * n) {
        int a, b;
        cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    bool f = work(p[1].F) || work(p[1].S);
    if (!f) {
        cout << "-1\n";
        return;
    }
}

int main() {
    Waimai;
    int tt;
    cin >> tt;
    while (tt--) solve();
}