#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rp(i,x,y) for(register ll i=x;i<=y;++i)
#define my(i,x,y) for(register ll i=y;i>=x;--i)

+;
ll n,m,fa[N<<],ys[N],cnt;
];
bool flg;

inline ll read()
{
    ;;
    '))ch=getchar();
    ;
    )+(x<<)+(ch^'),ch=getchar();
    return y?x:-x;
}
ll fd(ll x){if(fa[x]==x)return x;return fa[x]=fd(fa[x]);}
inline bool cmp(ed x,ed y){return x.from<y.from;}
inline void pre()
{
    n=read(),m=read();
    rp(i,,m)edge[++cnt].from=read(),edge[cnt].to=read();
    rp(i,,n)ys[read()]=i;
    -){printf(;return;}
    rp(i,,m){edge[i].from=ys[edge[i].from],edge[i].to=ys[edge[i].to];if(edge[i].to<edge[i].from)swap(edge[i].to,edge[i].from);}
    rp(i,,m<<)fa[i]=i;
    sort(edge+,edge++cnt,cmp);
}
inline void work()
{
    rp(i,,m)
        my(j,,i-)
            if(edge[j].from<edge[i].from && edge[j].to>edge[i].from && edge[i].to>edge[j].to)
            {
                fa[fd(j)]=fd(i+m);
                fa[fd(i)]=fd(j+m);
                if(fd(i)==fd(i+m) || fd(j)==fd(j+m)){printf("NO\n");return;}
            }
    printf("YES\n");
}

int main()
{
    ll T=read();
    ;pre();if(!flg)work();}
    ;
}