// 21:50
#include <iostream>
#include <cstdio>
#include <utility>
#include <algorithm>
#include <cstring>
#include <assert.h>
#define mn 100005

using namespace std;

int T, n, m, num;

struct Node {
    int l, r, id;
}a[mn];

int cmp(Node &a, Node &b) {
    return a.l < b.l || (a.l == b.l && (a.r < b.r || (a.r == b.r && a.id < b.id)));
}

struct E {
    int to, nxt;
}e[mn * 90];

int cnt, h[mn * 6];
void add(int u, int v) {
    // printf("e%d %d\n", u, v);
    e[++cnt] = (E){v, h[u]}, h[u] = cnt;
}

int rt, x, y, z, g;
struct tree {
    int l, r;
}tr[mn << 2];

int getl(int i) { return a[i].l; }
int getr(int i) { return a[i].r; }

void linkIn(int &u, int fa, int l, int r, int (*get)(int)) {
    if((l == r && l == g) || get(r) < x || get(l) > y) return;
    if(!u) {
        u = ++num;
        if(fa) {
            add((n << 1) + fa, (n << 1) + u);
            add((n << 2) + u, (n << 2) + fa);
        }
    }
    // printf("%d %d %d %d %d\n", g, l, r, x, y);
    if((g < l || g > r) && get(l) >= x && get(r) <= y) {
        add(n + z, (n << 1) + u);
        add((n << 2) + u, z);
        return;
    }
    int mid = (l + r) >> 1;
    linkIn(tr[u].l, u, l, mid, get);
    linkIn(tr[u].r, u, mid + 1, r, get);
}

void linkOut(int &u, int fa, int l, int r) {
    if(!u) {
        u = ++num;
        if(fa) {
            add((n << 1) + fa, (n << 1) + u);
            add((n << 2) + u, (n << 2) + fa);
        }
    }
    if(l == r) {
        add((n << 1) + u, z);
        add(n + z, (n << 2) + u);
        return;
    }
    int mid = (l + r) >> 1;
    if(g <= mid) linkOut(tr[u].l, u, l, mid);
    else linkOut(tr[u].r, u, mid + 1, r);
}

int dnum, tp, dfn[mn * 6], low[mn * 6], st[mn * 6], ins[mn * 6];
int cnum, c[mn * 6];
void tarjan(int u) {
    dfn[u] = low[u] = ++dnum;
    st[++tp] = u, ins[u] = 1;
    for(int i = h[u]; i; i = e[i].nxt) {
        int v = e[i].to;
        if(!dfn[v]) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else if(ins[v]) {
            low[u] = min(low[u], dfn[v]);
        }
    }
    if(dfn[u] == low[u]) {
        ++cnum;
        int v;
        do {
            v = st[tp--], ins[v] = 0;
            c[v] = cnum;
        } while(v != u);
    }
}

int main() {
    scanf("%d", &T);
    while(T--) {
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; ++i) {
            scanf("%d%d", &a[i].l, &a[i].r);
            a[i].id = i;
        }
        for(int i = 1; i <= m; ++i) {
            int x, y;
            scanf("%d%d", &x, &y);
            add(x, y + n), add(y, x + n);
        }
        num = 0;
        rt = 0;
        sort(a + 1, a + n + 1, cmp);
        for(int i = 1; i <= n; ++i) {
            g = i, x = a[i].l, y = a[i].r, z = a[i].id;
            linkIn(rt, 0, 1, n, getl);
            linkOut(rt, 0, 1, n);
        }

        dnum = tp = cnum =  0;
        int N = (n << 2) + num;
        for(int i = 1; i <= N; ++i) {
            dfn[i] = low[i] = ins[i] = c[i] = 0;
        }
        for(int i = 1; i <= N; ++i) {
            if(!dfn[i]) {
                tarjan(i);
            }
        }
        int fl = 1;
        for(int i = 1; i <= n; ++i) {
            assert(c[i] != 0);
            if(c[i] == c[i + n]) {
                fl = 0; break;
            }
        }
        // for(int i = (n << 1) + 1; i <= (n << 2); ++i) {
        //     assert(c[i] != 0);
        //     if(c[i] == c[i + (n << 1)]) {
        //         fl = 0; break;
        //     }
        // }
        puts(fl ? "YES" : "NO");

        cnt = 0;
        for(int i = 1; i <= N; ++i) {
            h[i] = 0;
        }
        for(int i = 1; i <= num; ++i) {
            tr[i].l = tr[i].r = 0;
        }
    }
    return 0;
}