#include <bits/stdc++.h>

using namespace std;

#define gc getchar()

inline int read() {

    int x = ; char c = gc;

    while(c < '' || c > '') c = gc;

    while(c >= '' && c <= '') x = x *  + c - '', c = gc;

    return x;

}

#define LL long long

#define Rep(i, a, b) for(int i = a; i <= b; i ++)

const int N = 2e5 + ;

int A[N];

int n;

vector <int> V[N];

int W[N];

int B[N], js;

bool use[N];

int ls[N], len;

bool Cmp(int a, int b) {

    return W[a] < W[b];

}

void Bfs(int s) {

    queue <int> Q;

    use[s] = ;

    Q.push(s);

    while(!Q.empty()) {

        int tp = Q.front();

        B[++ js] = tp;

        Q.pop();

        len = ;

        int S = V[tp].size();

        Rep(i, , S - ) {

            int v = V[tp][i];

            if(use[v]) continue;

            use[v] = ;

            ls[++ len] = v;

        }

        sort(ls + , ls + len + , Cmp);

        Rep(i, , len) Q.push(ls[i]);

    }

}

int main() {

    n = read();

    Rep(i, , n - ) {

        int u = read(), v = read();

        V[u].push_back(v), V[v].push_back(u);

    }

    Rep(i, , n) A[i] = read();

    Rep(i, , n) W[A[i]] = i;

    Bfs();

    Rep(i, , n) {

        if(A[i] != B[i]) {

            cout << "No";

            return ;

        }

    }

    cout << "Yes";

    return ;

}