#include <bits/stdc++.h>
using namespace std;
const int N = 3e2 + 20;
vector<int> adj[N], vt, dfs_time;
int tin[N], tout[N];
bool visited[N];
int timer = 0, leaves = 0, indx = 0;
void set_time(int u = 1) {
  if (visited[u]) return;
  if (adj[u].size() == 1 && u != 1) leaves++;
  visited[u] = true;
  tin[u] = timer++;
  for (auto v : adj[u]) set_time(v);
  tout[u] = timer++;
  return;
}
bool is_reachable(int u, int v) {
  if (u <= 400 && v <= 400) return tin[u] <= tin[v] && tout[v] <= tout[u];
  return false;
}
void dfs(int u = 1, int par = -1) {
  if (u == vt[indx]) {
    indx++;
    dfs_time.push_back(u);
    return;
  }
  while (true) {
    dfs_time.push_back(u);
    bool f = false;
    for (auto v : adj[u]) {
      if (v == par) continue;
      if (is_reachable(v, vt[indx])) {
        dfs(v, u);
        f = true;
        break;
      }
    }
    if (!f) break;
  }
  return;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  set_time();
  for (int i = 0; i < leaves; i++) {
    int x;
    cin >> x;
    vt.push_back(x);
  }
  vt.push_back(100000);
  dfs();
  if ((int)dfs_time.size() != 2 * n - 1) {
    cout << -1;
    return 0;
  }
  for (int x : dfs_time) cout << x << " ";
}
