#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 60;
double pi = 3.141592653589793238462643383279L;
double eps = 1e-14;
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long popcount(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
int num[200001];
bool cmp(int a, int b) { return num[a] < num[b]; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> v[n + 1];
  for (long long i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  int a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    num[a[i]] = i;
  }
  for (long long i = 1; i < n + 1; i++) {
    sort(v[i].begin(), v[i].end(), cmp);
  }
  if (a[0] != 1) {
    cout << "No" << endl;
    return 0;
  }
  queue<int> q;
  q.push(1);
  int c = 1;
  bool used[n + 1];
  fill(used, used + n + 1, false);
  used[1] = true;
  while (q.size() > 0) {
    int now = q.front();
    q.pop();
    for (long long i = 0; i < v[now].size(); i++) {
      int ne = v[now][i];
      if (used[ne]) continue;
      if (a[c] != ne) {
        cout << "No" << endl;
        return 0;
      }
      q.push(ne);
      used[ne] = true;
      c++;
    }
  }
  cout << "Yes" << endl;
}
