#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int T,n,m,pcnt,df[N*60],lw[N*60],dfn,is[N*60],st[N*60],nu[N*60],pos[N<<2],tp,cnt;
vector<int>E[N*60];
struct P{int l,r,id;}p[N];
bool cmp1(P a,P b){return a.l<b.l;}
void Rd(int &x){
	x=0;
	char c=getchar();
	while(!isdigit(c))c=getchar();
	do {x=(x<<1)+(x<<3)+(c^48);}while(isdigit(c=getchar()));
}
void edge_Add(int p,int z,int y,int c,int l,int r){
	if(l<=z&&y<=r){
//		printf("__%d %d    %d %d\n",p,pos[c],z,y);
		E[p<<1].push_back(pos[c]<<1|1);
		E[pos[c]<<1].push_back(p<<1|1);
		return;
	}
	int mid=(z+y)>>1;
	if(l<=mid)edge_Add(p,z,mid,c<<1,l,r);
	if(r>mid)edge_Add(p,mid+1,y,c<<1|1,l,r);
}
void dfs(int x){
	df[x]=lw[x]=++dfn;
	st[++tp]=x,is[x]=1;
	for(auto to:E[x]){
		if(!df[to]){
			dfs(to);
			lw[x]=min(lw[to],lw[x]);
		}else if(is[to])lw[x]=min(lw[x],df[to]);
	}
	if(df[x]==lw[x]){
		++cnt;
		int y;
		do{
			y=st[tp--];
			is[y]=0;
			nu[y]=cnt;
		}while(y!=x);
	}
}
void Js(int z,int y,int c){
	if(z==y){
		pos[c]=p[z].id;
		return;
	}
	pos[c]=++pcnt;
	int mid=(z+y)>>1;
//	printf("___%d  %d %d\n",nc,l,r);
	E[pcnt<<1].clear(),E[pcnt<<1|1].clear();
	df[pcnt<<1]=df[pcnt<<1|1]=0;
	Js(z,mid,c<<1),Js(mid+1,y,c<<1|1);
	E[pos[c<<1]<<1].push_back(pos[c]<<1);
	E[pos[c<<1|1]<<1].push_back(pos[c]<<1);
	E[pos[c]<<1|1].push_back(pos[c<<1]<<1|1);
	E[pos[c]<<1|1].push_back(pos[c<<1|1]<<1|1);
}
void slv(){
	Rd(n),Rd(m);
	for(int i=1;i<=n;++i){
		Rd(p[i].l),Rd(p[i].r);
		p[i].id=i;
		E[i<<1].clear(),E[i<<1|1].clear();
		df[i<<1]=df[i<<1|1]=0;
	}
	pcnt=n;
	sort(p+1,p+n+1,cmp1);
	Js(1,n,1);
	for(int i=1;i<=n;++i){
		int l=i+1,r=n,rs=i;
		while(l<=r){
			int mid=(l+r)>>1;
			if(p[mid].l<=p[i].r){
				rs=mid;
				l=mid+1;
			}else r=mid-1;
		}
//		printf("          __%d     %d %d\n",p[i].id,i+1,rs);
		if(i+1<=rs)edge_Add(p[i].id,1,n,1,i+1,rs);
	}
//	puts("?????");
	for(int i=1;i<=m;++i){
		int x,y;
		Rd(x),Rd(y);
		E[x<<1|1].push_back(y<<1);
		E[y<<1|1].push_back(x<<1);
	}
	for(int i=1;i<=n;++i){
		if(!df[i<<1])dfs(i<<1);
		if(!df[i<<1|1])dfs(i<<1|1);
		if(nu[i<<1]==nu[i<<1|1]){
			puts("NO");
			return;
		}
	}
	puts("YES");
//	for(int i=1;i<=pcnt;++i){
//		for(auto x:E[i<<1])printf("%d %d\n",i<<1,x);
//		for(auto x:E[i<<1|1])printf("%d %d\n",i<<1|1,x);
//	}
}
int main(){
//	freopen("a.in","r",stdin);
//	freopen("a.out","w",stdout);
	scanf("%d",&T);
	while(T--)slv();
}