#include <bits/stdc++.h>
using namespace std;
const long long int N = 303;
const long long int LG = 14;
long long int parent[LG][N], arr[N], n, depth[N];
vector<long long int> adj[N], ans;
void precompute() {
  for (long long int i = 1; i < LG; i++) {
    for (long long int j = 1; j <= n; j++) {
      if (parent[i - 1][j]) parent[i][j] = parent[i - 1][parent[i - 1][j]];
    }
  }
}
long long int LCA(long long int u, long long int v) {
  if (depth[u] < depth[v]) swap(u, v);
  long long int diff = depth[u] - depth[v];
  for (long long int i = 0; i < LG; i++) {
    if (diff & (1 << i)) u = parent[i][u];
  }
  for (long long int i = LG - 1; i >= 0; i--) {
    if (parent[i][u] != parent[i][v]) {
      u = parent[i][u];
      v = parent[i][v];
    }
  }
  return parent[0][u];
}
void dfs(long long int cur, long long int par, long long int _depth = 0) {
  parent[0][cur] = par;
  depth[cur] = _depth;
  for (auto &itr : adj[cur]) {
    if (itr == par) continue;
    dfs(itr, cur, _depth + 1);
  }
}
void path1(long long int u, long long int v) {
  if (u == v) return;
  u = parent[0][u];
  while (u != v) {
    ans.push_back(u);
    u = parent[0][u];
  }
}
void path2(long long int u, long long int v) {
  if (u == v) return;
  vector<long long int> vect;
  v = parent[0][v];
  while (u != v) {
    vect.push_back(v);
    v = parent[0][v];
  }
  reverse(vect.begin(), vect.end());
  for (auto &itr : vect) ans.push_back(itr);
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (long long int i = 1; i < n; i++) {
    long long int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(1, 1);
  precompute();
  arr[1] = 1;
  long long int ind = 2;
  long long int temp;
  while (cin >> temp) arr[ind++] = temp;
  arr[ind++] = 1;
  ind--;
  for (long long int i = 1; i < ind; i++) {
    long long int lca = LCA(arr[i], arr[i + 1]);
    ans.push_back(arr[i]);
    path1(arr[i], lca);
    if (arr[i] != lca) ans.push_back(lca);
    path2(lca, arr[i + 1]);
  }
  if (ans.size() >= 2 * n) {
    cout << "-1";
    return 0;
  }
  for (auto &itr : ans) cout << itr << " ";
  return 0;
}
