#include <bits/stdc++.h>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
template <class T>
T sq(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
bool inside(T a, T b, T c) {
  return a <= b && b <= c;
}
template <class T>
void setmax(T& a, T b) {
  if (a < b) a = b;
}
template <class T>
void setmin(T& a, T b) {
  if (b < a) a = b;
}
template <class T>
T power(T N, T P) {
  return (P == 0) ? 1 : N * power(N, P - 1);
}
vector<int> path[302][302];
int d[302][302];
vector<int> P;
vector<int> G[302];
int cur;
void dfs(int u, int par) {
  int i, v;
  for (i = 0; i < ((int)G[u].size()); i++) {
    v = G[u][i];
    if (v == par) continue;
    d[cur][v] = d[cur][u] + 1;
    path[cur][v] = path[cur][u];
    path[cur][v].push_back(v);
    dfs(v, u);
  }
}
int main() {
  int n, T, t = 1, m, i, j, k;
  scanf("%d", &n);
  for (i = 1; i < n; i++) {
    scanf("%d", &j);
    scanf("%d", &k);
    j--;
    k--;
    G[j].push_back(k);
    G[k].push_back(j);
  }
  for (i = 0; i < n; i++) {
    cur = i;
    path[i][i].push_back(i);
    dfs(i, -1);
  }
  int ans = 0;
  m = 0;
  P.push_back(0);
  while (scanf("%d", &k) == 1) {
    k--;
    ans += d[m][k];
    P.insert(P.end(), path[m][k].begin(), path[m][k].end());
    m = k;
  }
  k = 0;
  ans += d[m][k];
  P.insert(P.end(), path[m][k].begin(), path[m][k].end());
  if (ans != 2 * (n - 1)) {
    puts("-1");
    return 0;
  }
  P.resize(unique(P.begin(), P.end()) - P.begin());
  for (i = 0; i < ((int)P.size()); i++)
    printf("%d%c", P[i] + 1, i == ((int)P.size()) - 1 ? '\n' : ' ');
  return 0;
}
