#include<bits/stdc++.h>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
using namespace std;
constexpr int M=2e5+5;
struct info{ int l,r,id;
    bool operator <(const info &a) const
        {return l==a.l?r<a.r:l<a.l;}
}a[M];
vector<int>adj[M*10];
int dfn[M*10],low[M*10],stk[M*10],scc[M*10];
int n,m,q,num,idx,tp,lsh[M],pos[M],res[M],id[M*10][2];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void Tarjan(int x){
    dfn[x]=low[x]=++idx;stk[++tp]=x;
    for (auto y:adj[x]){
        if (!dfn[y]) Tarjan(y),low[x]=min(low[x],low[y]);
        if (!scc[y]) low[x]=min(low[x],dfn[y]);
    }
    if (dfn[x]!=low[x]) return;
    scc[x]=x; while (stk[tp]!=x)
        scc[stk[tp--]]=x; tp--;
}
void build(int l,int r,int x){
    if (l==r) return id[x][0]=l,id[x][1]=l+n,void();
    int mid=l+r>>1; build(l,mid,ls(x)); build(mid+1,r,rs(x));
    id[x][0]=++m;
    adj[m].emplace_back(id[ls(x)][0]);
    adj[m].emplace_back(id[rs(x)][0]);
    id[x][1]=++m;
    adj[id[ls(x)][1]].emplace_back(m);
    adj[id[rs(x)][1]].emplace_back(m);
}
void update(int p,int L,int R,int l=1,int r=n,int x=1){
    if (L<=l&&r<=R){
        adj[p+n].emplace_back(id[x][0]);
        adj[id[x][1]].emplace_back(p);
        return;
    } int mid=l+r>>1;
    if (L<=mid) update(p,L,R,l,mid,ls(x));
    if (R>mid) update(p,L,R,mid+1,r,rs(x));
}
void solve(){
    n=read();q=read();num=0;
    for (int i=1;i<=n;i++)
        lsh[++num]=a[i].l=read(),
        lsh[++num]=a[i].r=read(),a[i].id=i;
    sort(a+1,a+n+1);
    sort(lsh+1,lsh+num+1);num=unique(lsh+1,lsh+num+1)-lsh-1;
    for (int i=1;i<=n;i++) pos[a[i].id]=i,
        a[i].l=lower_bound(lsh+1,lsh+num+1,a[i].l)-lsh,
        a[i].r=lower_bound(lsh+1,lsh+num+1,a[i].r)-lsh;
    for (int i=1;i<=q;i++){
        int x=pos[read()],y=pos[read()];
        adj[x].emplace_back(y+n);
        adj[y].emplace_back(x+n);
    }
    m=n<<1;build(1,n,1);
    for (int i=1;i<=num;i++) res[i]=0;
    for (int i=1;i<=n;i++) res[a[i].l]=i;
    for (int i=1;i<=num;i++) if (!res[i]) res[i]=res[i-1];
    for (int i=1;i<=n;i++)
        if (i<res[a[i].r])
            update(i,i+1,res[a[i].r]);
    idx=tp=0;
    for (int i=1;i<=m;i++) dfn[i]=low[i]=scc[i]=0;
    for (int i=1;i<=m;i++)
        if (!dfn[i]) Tarjan(i);
    for (int i=1;i<=m;i++) adj[i].clear();
    for (int i=1;i<=n;i++)
        if (scc[i]==scc[i+n])
            return puts("NO"),void();
    puts("YES");
}
int main(){int T=read();while (T--) solve();return 0;}