#include<bits/stdc++.h>
using namespace std;
using lli = long long;
const int maxN = 2e5 + 5;
int n,a[maxN],op[maxN],ma[maxN];
int ch[maxN],val[maxN],st,p[maxN];
vector<int> adj[maxN];
vector<int> res;
void input()
{
    cin >> n;
    res.clear();
    for (int i = 1;i <= 2 * n;++i)
    {
        adj[i].clear();op[i] = 0;
        ma[i] = 0;val[i] = 0;ch[i] = 0;
        p[i] = 0;
    }
    for (int i = 1;i <= 2 * n;++i)
    {
        cin >> a[i];
        op[a[i]] += i;
    }
    for (int i = 1;i < 2 * n;++i)
    {
        int u,v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    st = op[a[1]] - 1;
}
void dfs(int u,int par)
{
    ch[u] = 0;
    for (int v : adj[u])
    {
        if (v == par) continue;
        dfs(v,u);
        ch[u] = max(ch[v],ch[u]);
    }
    if (ma[op[a[u]] - u] == 1) ch[u] = 1;
    ma[u] = 1;
    p[u] = par;
}
bool check()
{
    for (int i = 1;i <= 2 * n;++i) if (ch[i] & ch[op[a[i]] - i]) return false;
    return true;
}
void calc(int u,int par)
{
    for (int v : adj[u])
    {
        if (v == par) continue;
        val[v] = -1;
        val[op[a[v]] - v] = 1;
        calc(v,u);
    }
}
void sol(int u,int par)
{
//    cout << u << " " << val[u] << "\n";
    if (val[u] == 0)
    {
        int v = op[a[u]] - u;
        if (ch[v])
        {
            val[u] = -1;
            calc(u,p[u]);
            val[v] = 1;
        }
        else
        {
//            cout << u << "a\n";
            res.push_back(u);
            val[v] = -1;
            calc(v,p[v]);
            val[u] = 1;
        }
//        if (u == 1) cout << val[v] << "a\n";
    }
    else if (val[u] == 1) res.push_back(u);
    else return;
    for (int v : adj[u])
    {
        if (v == par) continue;
        sol(v,u);
    }

}
void solve1()
{
    for (int i = 1;i <= 2 * n;++i)
    {
        ma[i] = 0;val[i] = 0;ch[i] = 0;
    }
    res.clear();
    dfs(st,0);
    if (check())
    {
        sol(st,0);
        if (res.size() == n)
        {
            for (int s : res)
            cout << s << " ";
            cout << "\n";
        }
        else cout << -1 << "\n";
    }
    else cout << -1 << "\n";
}
void solve()
{
    dfs(1,0);
//    for (int i = 1;i <= 2 * n;++i) cout << ch[i] << "\n";
    if (check())
    {
        sol(1,0);
        if (res.size() == n)
        {
            for (int s : res)
            cout << s << " ";
            cout << "\n";
        }
        else solve1();
    }
    else solve1();
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen("P4.inp","r",stdin);
    //freopen("P4.out","w",stdout);
    int t;
    cin >> t;
    while (t--)
    {
        input();
        solve();
    }
}