#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <cmath>

#include <iostream>

#include <set>

#define MAXN 50010

using namespace std;

struct hhh{

    int x,y,num;

    void read(){

        scanf("%d%d%d",&x,&y,&num);

    }

}aum[MAXN];

struct hhhh{

    int x,y,num;

    void read(){

        scanf("%d%d%d",&x,&y,&num);

    }

}qv[MAXN];

struct data{

    int y,num;

    bool operator < (const data x)const{

        return x.y>y;

    }

};

multiset<data> s;

multiset<data>::iterator it;

int n,m,have;

void cl(){

    memset(qv,,sizeof(qv));

    memset(aum,,sizeof(aum));

    s.clear();

}

bool cmp1(hhh x,hhh y){

    if(x.x<y.x) return ;

    return ;

}

bool cmp2(hhhh x,hhhh y){

    if(x.x<y.x) return ;

    return ;

}

int getit(int hh){

    for(int i=n;i>=;i--) if(qv[i].x<=hh) return i;

    return ;

}

int getmin(int r,int now){

    int numm=(<<),id=;

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

        if(qv[i].num==) continue;

        if(qv[i].y<aum[now].y) continue;

        if(numm>qv[i].y) numm=qv[i].y,id=i;

    }

    return id;

}

void work(){

    cl();

    scanf("%d%d",&n,&m);for(int i=;i<=MAXN-;i++) qv[i].x=<<;

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

    for(int i=;i<=m;i++) qv[i].read();

    have=m;

    sort(aum+,aum+n,cmp1);

    sort(qv+,qv+m+,cmp2);

    if(qv[].x>aum[].x){puts("No");return;}

    int id=;s.insert((data){qv[].y,qv[].num});

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

        int x=aum[i].x,y=aum[i].y,num=aum[i].num;

        while(qv[id+].x<=x){

            id++;    if(qv[id].num!=)    s.insert((data){qv[id].y,qv[id].num});

        }

        while(num){

            it=s.lower_bound((data){y,});

            if(it==s.end()){puts("No");return;}

            data xx=*it;int numm=xx.num;

            if(num>=numm) num-=numm,s.erase(it),have--;

            else s.erase(it),s.insert((data){xx.y,numm-num}),num=;

            if(num!=&&have==){puts("No");return;}

        }

        if(have==&&i!=n){puts("No");return;}

    }

    puts("Yes");

}

int main()

{

    int t;cin>>t;

    while(t--) work();

    return ;

}