#include <bits/stdc++.h>
using namespace std;
const int sz = 300 + 10;
const int OO = 0x3f3f3f3f;
int n;
vector<int> adj[sz], ans;
int sorting_val[sz];
void dfs(int node, int p) {
  for (int i = 0; i < adj[node].size(); i++) {
    int ch = adj[node][i];
    if (ch != p) {
      dfs(ch, node);
      sorting_val[node] = min(sorting_val[node], sorting_val[ch]);
    }
  }
}
void dfs2(int node, int p) {
  ans.push_back(node);
  for (int i = 0; i < adj[node].size(); i++) {
    int ch = adj[node][i];
    if (ch != p) {
      dfs2(ch, node);
      ans.push_back(node);
    }
  }
}
bool cmp(int x, int y) { return sorting_val[x] < sorting_val[y]; }
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  int k = 0;
  for (int i = 2; i <= n; i++) {
    if (adj[i].size() == 1) {
      k++;
    }
  }
  int last = -1;
  memset(sorting_val, OO, sizeof(sorting_val));
  vector<int> leaves;
  for (int i = 0; i < k; i++) {
    int x;
    cin >> x;
    leaves.push_back(x);
    sorting_val[x] = i;
  }
  dfs(1, -1);
  for (int i = 1; i <= n; i++) {
    sort(adj[i].begin(), adj[i].end(), cmp);
  }
  dfs2(1, -1);
  vector<int> check;
  for (int i = 0; i < ans.size(); i++) {
    if (adj[ans[i]].size() == 1 && ans[i] != 1) {
      check.push_back(ans[i]);
    }
  }
  if (check != leaves) {
    cout << -1;
    return 0;
  }
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
