#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


/*
  determined by operation order around u
  condition for path s i[0] u[1] i[1] ... i[d-2] u[d-1] i[d-1] t
    s: (first ->) i[0]
    u[1]: i[0] -> i[1]
    ...
    u[d-1]: i[d-2] -> i[d-1]
    t: i[d-1] (-> last)
*/

int N;
vector<int> U;
vector<int> A, B;

int M;
int ver(int u) { return ((N - 1) << 1) + u; }
vector<int> as, bs;
vector<vector<int>> G;
vector<int> to, fr;

bool check(int u, int i, int j) {
// cerr<<"[check] "<<u<<" "<<i<<" "<<j<<endl;
  if (~to[i]) return false;
  if (~fr[j]) return false;
  if (root(i) == root(j) && -uf[root(i)] != 1 + (int)G[u].size()) return false;
  return true;
}
void add(int u, int i, int j) {
  to[i] = j;
  fr[j] = i;
  connect(i, j);
}

vector<int> pari;
int dfs(int u, int i) {
  int ret = N;
  if (check(u, i, ver(u))) {
    chmin(ret, u);
  }
  for (const int j : G[u]) if (i != j) {
    const int v = (!(j & 1)) ? B[j >> 1] : A[j >> 1];
    pari[v] = j;
    if (check(u, i, j)) {
      const int res = dfs(v, j ^ 1);
      chmin(ret, res);
    }
  }
  return ret;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    U.resize(N);
    for (int x = 0; x < N; ++x) {
      scanf("%d", &U[x]);
      --U[x];
    }
    A.resize(N - 1);
    B.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d", &A[i], &B[i]);
      --A[i];
      --B[i];
    }
    
    M = ((N - 1) << 1) + N;
    G.assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      G[A[i]].push_back(i << 1 | 0);
      G[B[i]].push_back(i << 1 | 1);
    }
    uf.assign(M, -1);
    to.assign(M, -1);
    fr.assign(M, -1);
    
    vector<int> ans(N, -1);
    pari.assign(N, -1);
    for (int x = 0; x < N; ++x) {
      // U[x] -> ans[x]
      ans[x] = dfs(U[x], ver(U[x]));
// cerr<<"ans = "<<ans<<endl;
      assert(ans[x] < N);
      int j = ver(ans[x]);
      for (int v = ans[x]; v != U[x]; ) {
        const int i = pari[v];
        add(v, i ^ 1, j);
        v = (!(i & 1)) ? A[i >> 1] : B[i >> 1];
        j = i;
      }
      add(U[x], ver(U[x]), j);
    }
    
    for (int x = 0; x < N; ++x) {
      if (x) printf(" ");
      printf("%d", ans[x] + 1);
    }
    puts("");
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}