#include <bits/stdc++.h>
using namespace std;
vector<int> g[305];
bool u[305];
int en;
int n;
int cur;
int path[100005];
int cnt;
bool dfs(int x) {
  if (x == en) {
    path[cnt++] = x;
    return true;
  }
  u[x] = true;
  path[cnt++] = x;
  bool f = false;
  for (int i = 0; i < g[x].size(); i++) {
    int y = g[x][i];
    if (!u[y]) f |= dfs(y);
  }
  if (f) {
    return true;
  } else {
    cnt--;
    return false;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  cur = 1;
  while (cin >> en) {
    memset(u, false, sizeof(u));
    dfs(cur);
    cur = en;
    cnt--;
  }
  memset(u, false, sizeof(u));
  en = 1;
  dfs(cur);
  if (cnt != n * 2 - 1) {
    cout << -1 << endl;
  } else {
    for (int i = 0; i < cnt; i++) {
      cout << path[i] << ' ';
    }
    cout << endl;
  }
  return 0;
}
