#include <bits/stdc++.h>
using namespace std;
vector<vector<long long> > d(305, vector<long long>(305, 1e10));
vector<vector<long long> > path(305, vector<long long>(305, -1));
vector<long long> a(305);
long long k = 0, n;
vector<long long> ans;
void cnt_leaves(long long u, long long par) {
  long long f = 0;
  for (long long i = 1; i <= n; i++) {
    if (i == u || i == par || d[u][i] == 1e10) continue;
    f = 1;
    cnt_leaves(i, u);
  }
  if (!f) k++;
}
void get_path(long long i, long long j) {
  if (i == j)
    ans.push_back(i);
  else {
    get_path(i, path[i][j]);
    ans.push_back(j);
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long u, v;
    cin >> u >> v;
    d[u][v] = 1;
    path[u][v] = u;
    d[v][u] = 1;
    path[v][u] = v;
  }
  cnt_leaves(1, -1);
  for (long long i = 1; i <= k; i++) cin >> a[i];
  for (long long i = 1; i <= n; i++) d[i][i] = 0;
  for (long long k = 1; k <= n; k++) {
    for (long long i = 1; i <= n; i++) {
      for (long long j = 1; j <= n; j++) {
        if (d[i][j] > d[i][k] + d[k][j]) {
          d[i][j] = d[i][k] + d[k][j];
          path[i][j] = path[k][j];
        }
      }
    }
  }
  a[0] = 1;
  a[k + 1] = 1;
  for (long long i = 1; i <= k + 1; i++) get_path(a[i - 1], a[i]);
  ans.resize(distance(ans.begin(), unique((ans).begin(), (ans).end())));
  if ((long long)ans.size() != 2 * n - 1)
    cout << -1 << endl;
  else
    for (auto i : ans) cout << i << " ";
  return 0;
}
