#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> V[305], R;
int L[305];
bool dfs(int u, int v, int w) {
  if (u == v) return 1;
  for (int i = 0; i < V[u].size(); i++)
    if (w != V[u][i]) {
      if (dfs(V[u][i], v, u)) {
        R.push_back(V[u][i]);
        return 1;
      }
    }
  return 0;
}
int main() {
  int u, v;
  scanf("%d", &N);
  for (int i = 1; i < N; i++) {
    scanf("%d %d", &u, &v);
    V[u].push_back(v);
    V[v].push_back(u);
  }
  M = 0;
  int l;
  while (scanf("%d", &l) != EOF) L[M++] = l;
  int k = L[0];
  dfs(k, 1, 0);
  for (int i = 1; i < M; i++) {
    dfs(L[i], k, 0);
    k = L[i];
  }
  dfs(1, k, 0);
  R.push_back(1);
  if (R.size() > 2 * N - 1) {
    printf("-1");
    return 0;
  }
  for (int i = 0; i < R.size(); i++) printf("%d ", R[i]);
}
