#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l,int r)
{
    return uniform_int_distribution<int>(l,r)(rd);
}
inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}
void phongbeo();
const int inf = 1e16;
const ll mod2 = 1e9+7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0)x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int el = 19;
main()
{
    if(fopen(task2".inp","r"))
    {
        fin(task2);
        fou(task2);
    }
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
    //modwwe
    phongbeo();
    // checktime
}
vector<int> v;
ib a[300001];
id b[300001];
int ans[300001];
int last[300001];
int c[300001];
int net[300001];
bool cmp(ib a,ib b)
{
    return a.b<b.b;
}
bool cmp2(id a,id b)
{
    return a.a<b.a;
}
struct seg
{
    int tlow[1200001];
    int thigh[1200001];
    void reset(int x)
    {
        for(int i=1; i<=4*x; i++)
            tlow[i]=thigh[i]=inf;
    }
    void upd(int node,int l,int r,int l1,int x,int y)
    {
        if(l==r)
        {
            tlow[node]=min(tlow[node],x);
            thigh[node]=min(thigh[node],y);
            return;
        }
        int mid=l+r>>1;
        if(l1<=mid)
            upd(node<<1,l,mid,l1,x,y);
        else upd(node<<1|1,mid+1,r,l1,x,y);
        tlow[node]=min(tlow[node<<1],tlow[node<<1|1]);
        thigh[node]=min(thigh[node<<1],thigh[node<<1|1]);
    }
    int getlow(int node,int l,int r,int l1,int r1)
    {
        if(l>r1||r<l1||tlow[node]==inf) return inf;
        if(l>=l1&&r<=r1) return tlow[node];
        int mid=l+r>>1;
        return min(getlow(node<<1,l,mid,l1,r1),getlow(node<<1|1,mid+1,r,l1,r1));
    }
    int gethigh(int node,int l,int r,int l1,int r1)
    {
        if(l>r1||r<l1||thigh[node]==inf) return inf;
        if(l>=l1&&r<=r1) return thigh[node];
        int mid=l+r>>1;
        return min(gethigh(node<<1,l,mid,l1,r1),gethigh(node<<1|1,mid+1,r,l1,r1));
    }
} st;
void phongbeo()
{
    cin>>n>>m>>k;
    for(int i=1; i<=m; i++)
        cin>>a[i].a>>a[i].a>>a[i].b,v.pb(a[i].b),net[i]=1e15;
    sort(a+1,a+1+m,cmp);
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    for(int i=1; i<=m; i++)
    {
        net[last[a[i].a]]=i;
        if(last[a[i].a]==0)s3=i;
        last[a[i].a]=i;
    }
    for(int i=2; i<=n; i++)
        if(last[i]==0)
        {
            cin>>m;
            while(m--)
            {
                cout<<"No\n";
            }
            exit(0);
        }
    s9=a[s3].b;
    for(int i=1; i<=m; i++)
    {
        c[i]=s3;
        s3=max(s3,net[i]);
    }
    st.reset(v.size());
    cin>>n;
    for(int i=1; i<=n; i++)
        cin>>b[i].a>>b[i].b>>b[i].c,b[i].d=i;
    sort(b+1,b+1+n,cmp2);
    l=1;
    for(i=1; i<=n; i++)
    {
        while(l<=m&&a[l].b<=b[i].a)
        {
            if(c[l]==1e15)
            {
                l++;
                continue;
            }
            s3=a[c[l]].b;
            s5=lower_bound(v.begin(),v.end(),s3)-v.begin()+1;
            st.upd(1,1,v.size(),s5,-a[l].b,s3-a[l].b);
            l++;
        }
        s4=0;
        if(l==1)
        {
            s4=s9-b[i].b;
        }
        else
        {
            s5=lower_bound(v.begin(),v.end(),b[i].b)-v.begin()+1;
            s4=min(st.gethigh(1,1,v.size(),s5,v.size())+b[i].a-b[i].b,
                   st.getlow(1,1,v.size(),1,s5-1)+b[i].a);
        }
        if(l<=m&&c[l]!=1e15)s4=min(s4,a[c[l]].b-b[i].b);
        if(s4<=b[i].c)ans[b[i].d]=1;
    }
    for(int i=1; i<=n; i++)
        if(ans[i])cout<<"Yes\n";
        else cout<<"No\n";

}