#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + "," +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug() { cerr << endl; }
template <typename Head, typename... Tail>
void debug(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug(T...);
}
struct fast_power {
  long long integer(long long n, long long e,
                    long long my_mod = 9223372036854775807LL) {
    long long ans = 1;
    while (e) {
      if (e & 1)
        ans = (ans * n) % my_mod, e--;
      else
        n = (n * n) % my_mod, e >>= 1;
    }
    return ans;
  }
  long long matrix(vector<vector<long long>> &n, long long e,
                   long long my_mod = 9223372036854775807LL);
};
struct euclidean {
  int gcdi(int a, int b) { return b ? gcdi(b, a % b) : a; }
  double gcdf(double a, double b, double accuracy) {
    return b <= accuracy ? a : gcdf(b, fmod(a, b), accuracy);
  }
};
const int INF = 0x3f3f3f3f;
const int maxn = 300 + 5;
int arr[maxn][maxn] = {0};
vector<int> G[maxn];
int a[maxn];
int brr[maxn] = {0}, num;
void dfs1(int n, int pre) {
  if (brr[n]) arr[n][n] = 1;
  int pos = -1;
  for (int i = 0; i < G[n].size(); i++)
    if (G[n][i] == pre) pos = i;
  if (pos != -1) swap(G[n][pos], G[n][G[n].size() - 1]);
  for (int i = 0; i < G[n].size(); i++) {
    if (G[n][i] == pre) continue;
    dfs1(G[n][i], n);
    for (int q = 1; q <= num; q++) arr[n][q] |= arr[G[n][i]][q];
  }
}
int ok = 1, cnt = 0;
vector<int> ans;
int vis[maxn] = {0};
int crr[maxn] = {0};
void dfs2(int n, int pre) {
  if (vis[n] >= crr[n]) return;
  vis[n]++;
  ans.push_back(n);
  if (!arr[n][a[cnt]]) {
    for (int i = 0; i < G[n].size(); i++) dfs2(G[n][i], n);
  } else {
    if (n == a[cnt]) {
      cnt++;
      for (int i = 0; i < G[n].size(); i++) {
        dfs2(G[n][i], n);
      }
    } else {
      while (1) {
        int f = 1;
        for (int i = 0; i < G[n].size(); i++) {
          if (G[n][i] == pre) continue;
          if (arr[G[n][i]][a[cnt]]) {
            f = 0;
            int s = G[n][i];
            G[n].erase(G[n].begin() + i, G[n].begin() + i + 1);
            dfs2(s, n);
            break;
          }
        }
        if (f) break;
      }
      for (int i = 0; i < G[n].size(); i++) dfs2(G[n][i], n);
    }
  }
}
int getnum(int n, int pre) {
  int num = 0, f = 1;
  for (int i = 0; i < G[n].size(); i++)
    if (G[n][i] != pre) f = 0, num += getnum(G[n][i], n);
  return num + f;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> num;
  for (int i = 0; i < num - 1; i++) {
    int f1, f2;
    cin >> f1 >> f2;
    G[f1].push_back(f2), G[f2].push_back(f1);
    crr[f1]++, crr[f2]++;
  }
  int k = getnum(1, -1);
  for (int i = 0; i < k; i++) cin >> a[i], brr[a[i]] = 1;
  a[k] = 0;
  dfs1(1, -1);
  dfs2(1, -1);
  if (cnt == k) {
    ans.push_back(1);
    for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
    cout << endl;
  } else
    cout << -1 << endl;
  return 0;
}
