#include <bits/stdc++.h>
using namespace std;
int n, cnt, tot, ret, flag = true;
int w[310], ansp[310 * 2], isL[310], vis[310], leaf[310];
int mat[310][310], g[310][310];
int lenp[310], len[310], in[310], root;
bool cmp(int a, int b) { return w[a] < w[b]; }
void dfs(int u, int fa) {
  int i, j;
  vis[fa] = 1;
  if (isL[u]) return;
  for (i = 1; i <= len[u]; ++i) {
    int x = mat[u][i];
    if (vis[x]) continue;
    dfs(x, u);
    lenp[u]++;
    g[u][lenp[u]] = x;
    w[u] = max(w[u], w[x]);
  }
  sort(g[u] + 1, g[u] + 1 + lenp[u], cmp);
}
void dfsp(int u) {
  int i, j;
  if (isL[u]) {
    ansp[++tot] = u;
    ++ret;
    if (leaf[ret] != u) flag = false;
    return;
  }
  ansp[++tot] = u;
  for (i = 1; i <= lenp[u]; ++i) {
    int x = g[u][i];
    dfsp(x);
    ansp[++tot] = u;
  }
}
int main() {
  int i, j, a, b, x;
  scanf("%d", &n);
  for (i = 1; i < n; ++i) {
    scanf("%d%d", &a, &b);
    len[a]++, len[b]++;
    mat[a][len[a]] = b;
    mat[b][len[b]] = a;
    in[a]++;
    in[b]++;
  }
  while (scanf("%d", &x) != EOF) {
    leaf[++cnt] = x;
    w[x] = cnt;
    isL[x] = true;
  }
  if (cnt == n) {
    puts("-1");
    return 0;
  }
  for (i = 1; i <= n; ++i)
    if (!isL[i] && in[i] == 1) {
      dfs(i, 0);
      root = i;
      break;
    }
  if (!root) {
    for (i = 1; i <= n; ++i)
      if (!isL[i]) {
        dfs(i, 0);
        root = i;
        break;
      }
  }
  flag = true;
  dfsp(root);
  if (!flag)
    puts("-1");
  else {
    for (i = 1; i < 2 * n - 1; ++i) printf("%d ", ansp[i]);
    printf("%d\n", ansp[2 * n - 1]);
  }
  return 0;
}
