#include<algorithm>

#include<cstring>

#include<cstdio>

#include<iostream>

#include<vector>

#include<queue>

using namespace std;

const int N=2e5+;

int n,m,s;

int vis[N],giv[N],u[N],v[N],pos[N];

struct node

{

    int y,val;

};

bool operator < (node x,node y) {return x.val<y.val;}

vector<node> g[N];

vector <int> p;

inline int read()

{

    char ch=getchar();

    int s=,f=;

    while (ch<''||ch>'') {if (ch=='-') f=-;ch=getchar();}

    while (ch>=''&&ch<='') {s=(s<<)+(s<<)+ch-'';ch=getchar();}

    return s*f;

}

void bfs()

{

    queue <int> q;

    vis[]=;

    q.push();

    while (!q.empty())

    {

        int k=q.front();q.pop();

        p.push_back(k);

        for (int i=;i<g[k].size();i++)

        {

            int y=g[k][i].y;

            if (vis[y]) continue;

            vis[y]=;

            q.push(y);

        }

    }

}

int main()

{

    n=read();

    for (int i=;i<n;i++)

    {

        u[i]=read();v[i]=read();

    }

    for (int i=;i<=n;i++)

    {

        giv[i]=read();

        pos[giv[i]]=i;

    }

    for (int i=;i<n;i++)

    {

        g[u[i]].push_back((node){v[i],pos[v[i]]});

        g[v[i]].push_back((node){u[i],pos[u[i]]});

    }

    for (int i=;i<=n;i++) sort(g[i].begin(),g[i].end());

    /*for (int i=1;i<=n;i++)

    {

        for (int j=0;j<g[i].size();j++) printf("%d ",g[i][j].val);

        printf("\n");

    }*/

    bfs();

    bool flag=;

    for (int i=;i<=n;i++) if (p[i-]!=giv[i]) {flag=;break;}

    if (flag) puts("Yes");

    else puts("No");

    return ;

}