#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define rep(i, f, l) for(int i(f); i <= l; ++i)
#define per(i, f, l) for(int i(f); i >= l; --i)
const int N = 2e5 + 5;
const int M = 1e3 + 5;
int n;
int c[N];
int Next[N << 1], head[N], ver[N << 1], tot;

void add(int x, int y) {
    ver[++tot] = y;
    Next[tot] = head[x];
    head[x] = tot;
}
int dfn[N], low[N], cnt, vis[N], stk[N], top, co[N], sum;
bool fl = 0;
int total;
bool ex[N];
int lin[N];

void dfs(int x, int cnt) {
    if (cnt == n) {
        fl = 1;
        for (int i = 1; i <= n; i++)
            cout << lin[i] << " ";
        cout << endl;
        return;
    }
    if (fl == 1)
        return;
    for (int i = head[x]; i; i = Next[i]) {
        int y = ver[i];
        if (ex[c[y]] == 0) {
            ex[c[y]] = 1;
            lin[cnt + 1] = y;
            dfs(y, cnt + 1);
            ex[c[y]] = 0;
        }
        if (fl == 1)
            return;
    }
}

void work() {
    cin >> n;
    for (int i = 1; i <= 2 * n; i++) {
        cin >> c[i];
    }
    memset(head, 0, sizeof(head));
    tot = 0;
    for (int i = 1; i < 2 * n; i++) {
        int x, y;
        cin >> x >> y;
        add(x, y);
        add(y, x);
    }
    fl = 0;
    for (int i = 1; i <= 2 * n; i++) {
        if (c[i] == 1) {
                memset(ex,0,sizeof(ex));
            ex[1] = 1;
            lin[1] = 1;
            dfs(1, 1);
            if(fl==1)break;
        }
    }
    if (fl == 0)
        cout << "-1" << endl;
    return;
}

signed main() {
//  ios::sync_with_stdio(0);
//  cin.tie(0);
//  cout.tie(0);
    int t ;
    cin >> t;
    while (t--) {
        work();
    }
    return 0;
}