#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(args...) qqbx(#args, args)
#define orange(args...) danb(#args, args)
using std::cerr;
template <typename ...T> void qqbx(const char *s, T ...args) {
  int cnt = sizeof...(T);
  ((cerr << "\e[1;32m(" << s << ") = ("), ..., (cerr << args << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I> void danb(const char *s, I L, I R) {
  cerr << "\e[1;32m[ " << s << " ] = [ ";
  for (int f = 0; L != R; ++L) cerr << (f++ ? ", " : "") << *L;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#define orange(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)

namespace {
const int maxn = 10005;

struct HK {
  vector<int> l, r; int ans;
  HK(int n, int m, vector<bitset<maxn>> &g) : l(n,-1),r(m,-1),ans(0) {
    for (bool match = true; match; ) {
      match = false; vector<int> a(n, -1), p(n, -1);
      queue<int> q;
      for (int i = 0; i < n; i++)
        if (l[i] == -1) q.push(a[i] = p[i] = i);
      bitset<maxn> nvis, t;
      nvis.set();
      while (!q.empty()) {
        int x = q.front(); q.pop();
        if (l[a[x]] != -1) continue;
        for (int y = g[x]._Find_first(); y < maxn; y = g[x]._Find_next(y)) {
          if (r[y] == -1) {
            while (y != -1)
              r[y] = x, swap(l[x], y), x = p[x];
            match = true; ans++; break;
          } else if (p[r[y]] == -1) {
            q.push(y = r[y]), p[y] = x, a[y] = a[x];
          }
        }
      }
    }
  }
};

}

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int N;
  cin >> N;

  vector<int> pa(N), dep(N), tin(N), ord;

  {
    vector<vector<int>> g(N);
    for (int i = 1; i < N; i++) {
      int x, y;
      cin >> x >> y;
      --x, --y;
      g[x].emplace_back(y);
      g[y].emplace_back(x);
    }
    const auto dfs = [&](auto self, int i, int f) -> void {
      tin[i] = ord.size(); ord.push_back(i);
      pa[i] = f;
      for (int j: g[i]) {
        if (j == f) continue;
        dep[j] = dep[i] + 1;
        self(self, j, i);
      }
    };

    dfs(dfs, 0, -1);
  }

  vector<bitset<maxn>> g(N);
  for (int i = 0; i < N; i++)
    assert (g[i].none());

  const auto add_edge = [&](int x, int y) {
    g[x].set(y);
  };

  for (int i = 0; i < N; i++) {
    int x, y;
    cin >> x >> y;
    --x, --y;
    debug(x, y);
    while (x != y) {
      if (dep[x] > dep[y]) swap(x, y);
      add_edge(tin[y], i);
      y = pa[y];
    }
    add_edge(tin[x], i);
  }

  HK hk(N, N, g);

  if (hk.ans == N) {
    cout << "Yes\n";
    for (int i = 0; i < N; i++)
      cout << ord[hk.r[i]] + 1 << (i+1==N ? '\n' : ' ');
  } else {
    cout << "No\n";
  }
}