#include<bits/stdc++.h>

using namespace std;

const int N=;

int read()

{

    int x=,f=;char ch=getchar();

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

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

    return x*f;

}

int T,n,m,ind,top,cnt,scc,u[N],v[N];

int c[N],pos[N],last[N],dfn[N],low[N],q[N],bl[N],inq[N];

struct edge{int to,next;}e[N*];

void jb(int u,int v)

{

    e[++cnt].to=v;

    e[cnt].next=last[u];

    last[u]=cnt;

}

void tarjan(int x)

{

    inq[x]=;q[++top]=x;

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

    for (int i=last[x];i;i=e[i].next)

     if (!dfn[e[i].to])tarjan(e[i].to),low[x]=min(low[x],low[e[i].to]);

    else if(inq[e[i].to])low[x]=min(low[x],dfn[e[i].to]);

    int now=-;

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

     {

        scc++;

        while(now!=x)

          {

            now=q[top--];inq[now]=;

            bl[now]=scc;

          }

     }

}

int jud()

{

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

     if(bl[*i]==bl[*i-])return ;

    return ;

}

int main()

{

    T=read();

    while (T--)

     {

        n=read();m=read();

        for (int i=;i<=m;i++)u[i]=read(),v[i]=read();

        memset(last,,sizeof(last));cnt=;

        scc=ind=;

        memset(low,,sizeof(low));

        memset(dfn,,sizeof(dfn));

        for (int i=;i<=n;i++)c[i]=read();

         if (m>*n-){puts("NO");continue;}

        for (int i=;i<=n;i++)pos[c[i]]=i;

        top=;

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

         {

            v[i]=pos[v[i]];u[i]=pos[u[i]];

            if (u[i]>v[i])swap(u[i],v[i]);

            if (v[i]-u[i]==||(v[i]==n&&u[i]==))continue;

            u[++top]=u[i],v[top]=v[i];

         }

        m=top;

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

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

          if((u[i]<u[j]&&u[j]<v[i]&&v[i]<v[j])

          ||(u[j]<u[i]&&u[i]<v[j]&&v[j]<v[i]))

           {

            jb(*i-,*j);

            jb(*i,*j-);

            jb(*j-,*i);

            jb(*j,*i-);

           }

        top=;

        for (int i=;i<=*m;i++)

         if (!dfn[i])tarjan(i);

        if (jud())puts("YES");

        else puts("NO");

    }

    return ;

}