#include<algorithm>

#include<iostream>

#include<cstring>

#include<cctype>

#include<cstdio>

#include<vector>

#include<cmath>

using namespace std;

const int N=;

const int M=;

inline int read(){

    int X=,w=;char ch=;

    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}

    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();

    return w?-X:X;

}

struct node{

    int u,v;

}e[M];

int n,m,pos[N],t[N],fa[M*];

int find(int x){

    if(fa[x]==x)return x;

    return fa[x]=find(fa[x]);

}

inline bool unionn(int x,int y){

    int x1,y1;

    if(find(x)==find(y))return ;

    x1=find(x),y1=find(y+m);

    if(x1!=y1)fa[x1]=y1;

    x1=find(x+m),y1=find(y);

    if(x1!=y1)fa[x1]=y1;

    return ;

}

inline bool pan(int i,int j){

    int xi=pos[e[i].u],yi=pos[e[i].v];

    int xj=pos[e[j].u],yj=pos[e[j].v];

    if(xi>yi)swap(xi,yi);

    if(xj>yj)swap(xj,yj);

    if(xi>xj)swap(xi,xj),swap(yi,yj);

    return xi<xj&&xj<yi&&yi<yj;

}

int main(){

    int T=read();

    while(T--){

        bool ok=;

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

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

            e[i].u=read(),e[i].v=read();

        }

        for(int i=;i<=n;i++)t[i]=read(),pos[t[i]]=i;

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

        for(int i=;i<=*m;i++)fa[i]=i;

        for(int i=;i<=m&&ok;i++){

            for(int j=i+;j<=m&&ok;j++){

                if(pan(i,j)){

                    ok=unionn(i,j);

                }

            }

        }

        if(!ok)puts("NO");

        else puts("YES");

    }

    return ;

}