#include<cstdio>

#include<iostream>

#include<cstring>

#include<algorithm>

using namespace std;

const int maxn=;

const int maxm=;

struct zs{

    int too,pre;

}e[maxm];

struct zzs{

    int from,too;

}a[maxn*];

int last[maxn**],dfn[maxn**],low[maxn**],st[maxn**],bel[maxn**];

bool ins[maxn**];

int from[maxn*],too[maxn*],id[maxn];

int tot,tim,num,i,j,k,n,m,x,y,top,tt;

inline bool cant(int x,int b){

    if(a[x].from>a[b].from)swap(x,b);

    if(a[b].from>a[x].from&&a[b].from<a[x].too&&a[b].too>a[x].too)return ;

    return ;

}

void insert(int a,int b){

//    printf("%d-->%d\n",a,b);

    e[++tot].too=b;e[tot].pre=last[a];last[a]=tot;

    e[++tot].too=a;e[tot].pre=last[b];last[b]=tot;

}

void tarjan(int x){

    dfn[x]=low[x]=++tim;

    st[++top]=x;;ins[x]=;

    for(int i=last[x];i;i=e[i].pre)if(!dfn[e[i].too]){

        tarjan(e[i].too);low[x]=min(low[x],low[e[i].too]);

    }else if(ins[e[i].too])low[x]=min(low[x],dfn[e[i].too]);

    if(dfn[x]==low[x]){

        num++;

        while(st[top+]!=x){

            ins[st[top]]=;bel[st[top]]=num;

            top--;

        }

    }

}

bool cmp(zzs a,zzs b){

    return a.from<b.from||(a.from==b.from&&a.too<b.too);

}

int main(){

    scanf("%d",&tt);

    while(tt--){

        scanf("%d%d",&n,&m);

        if(m>n*-){

            for(i=;i<=m<<;i++)scanf("%d",&j);

            for(i=;i<=n;i++)scanf("%d",&j);

            printf("NO\n");continue;

        }

        top=tim=tot=num=;

        memset(dfn,,*(*m+));

        memset(last,,*(*m+));

        for(i=;i<=m;i++)scanf("%d%d",&a[i].from,&a[i].too);

        for(i=;i<=n;i++)scanf("%d",&j),id[j]=i;

        for(i=;i<=m;i++){

            a[i].from=id[a[i].from];a[i].too=id[a[i].too];

            if(a[i].from>a[i].too)swap(a[i].from,a[i].too);

        }//按哈密顿回路给点重新编号，使1～n依次对应环中的点

        sort(a+,a++m,cmp);j=;

        for(i=;i<=m;i++){

            if(a[i].from+==a[i].too||a[i].too%n+==a[i].from)continue;

            j++;

            a[j].from=a[i].from,a[j].too=a[i].too;

        }

        m=j;

        for(i=;i<m;i++)for(j=i+;j<=m;j++){

            if(cant(i,j))insert(i*,j*-),insert(j*,i*-);//,printf("%d&&&%d\n",i,j);

            if(a[j].from>=a[i].too)break;

        }

        for(i=;i<=*m;i++)if(!dfn[i])tarjan(i);

        bool flag=;

        for(i=;i<=m;i++)if(bel[i*]==bel[i*-]){flag=;break;

        }

        if(flag)printf("NO\n");else printf("YES\n");

    }

    return ;

}