#include <bits/stdc++.h>
using namespace std;
const int maxn = 305;
int n, bol, v, ii;
int head[maxn], geshu[maxn], pan[maxn], vis[maxn], ans[100000],
    flag[maxn][maxn];
struct tree {
  int e, ne;
} edg[maxn];
struct node {
  int temp;
  int dd[maxn];
} num[maxn];
inline void init() {
  for (int i = 1; i <= n; i++) head[i] = -1;
}
void add(int s, int e) {
  edg[bol].e = e, edg[bol].ne = head[s], head[s] = bol++;
}
void dfs(int s, int temp) {
  if (geshu[s] == 1 && s != 1) {
    v++;
    num[s].temp = temp;
    for (int i = 0; i < temp; i++) num[s].dd[i] = pan[i], flag[s][pan[i]] = 1;
    return;
  }
  for (int i = head[s]; i != -1; i = edg[i].ne) {
    int e = edg[i].e;
    if (!vis[e]) {
      vis[e] = 1;
      pan[temp] = e;
      dfs(e, temp + 1);
    }
  }
}
int main() {
  int a, b;
  cin >> n;
  init();
  for (int i = 1; i < n; i++) {
    scanf("%d %d", &a, &b);
    add(a, b), add(b, a);
    geshu[a]++, geshu[b]++;
  }
  vis[1] = 1, pan[0] = 1;
  dfs(1, 1);
  b = 0, num[0].temp = 1, num[0].dd[0] = 1;
  for (int i = 0; i < v; i++) {
    scanf("%d", &a);
    for (int j = num[b].temp - 1; j >= 0; j--) {
      ans[ii++] = num[b].dd[j];
      if (flag[a][num[b].dd[j]]) break;
    }
    int p = 0;
    for (int j = 0; j < num[a].temp - 1; j++) {
      if (p) ans[ii++] = num[a].dd[j];
      if (ans[ii - 1] == num[a].dd[j]) p = 1;
    }
    b = a;
  }
  for (int i = num[a].temp - 1; i >= 0; i--) ans[ii++] = num[a].dd[i];
  if (ii >= 2 * n)
    cout << -1 << endl;
  else {
    for (int i = 0; i < ii; i++) printf("%d ", ans[i]);
    cout << endl;
  }
  return 0;
}
