#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using u128 = unsigned __int128;

template<class T,
    class Cmp = std::less<T>>
struct RMQ {
    const Cmp cmp = Cmp();
    static constexpr unsigned B = 64;
    using u64 = unsigned long long;
    int n;
    std::vector<std::vector<T>> a;
    std::vector<T> pre, suf, ini;
    std::vector<u64> stk;
    RMQ() {}
    RMQ(const std::vector<T> &v) {
        init(v);
    }
    void init(const std::vector<T> &v) {
        n = v.size();
        pre = suf = ini = v;
        stk.resize(n);
        if (!n) {
            return;
        }
        const int M = (n - 1) / B + 1;
        const int lg = std::__lg(M);
        a.assign(lg + 1, std::vector<T>(M));
        for (int i = 0; i < M; i++) {
            a[0][i] = v[i * B];
            for (int j = 1; j < B && i * B + j < n; j++) {
                a[0][i] = std::min(a[0][i], v[i * B + j], cmp);
            }
        }
        for (int i = 1; i < n; i++) {
            if (i % B) {
                pre[i] = std::min(pre[i], pre[i - 1], cmp);
            }
        }
        for (int i = n - 2; i >= 0; i--) {
            if (i % B != B - 1) {
                suf[i] = std::min(suf[i], suf[i + 1], cmp);
            }
        }
        for (int j = 0; j < lg; j++) {
            for (int i = 0; i + (2 << j) <= M; i++) {
                a[j + 1][i] = std::min(a[j][i], a[j][i + (1 << j)], cmp);
            }
        }
        for (int i = 0; i < M; i++) {
            const int l = i * B;
            const int r = std::min(1U * n, l + B);
            u64 s = 0;
            for (int j = l; j < r; j++) {
                while (s && cmp(v[j], v[std::__lg(s) + l])) {
                    s ^= 1ULL << std::__lg(s);
                }
                s |= 1ULL << (j - l);
                stk[j] = s;
            }
        }
    } 
    T operator()(int l, int r) {
        if (l / B != (r - 1) / B) {
            T ans = std::min(suf[l], pre[r - 1], cmp);
            l = l / B + 1;
            r = r / B;
            if (l < r) {
                int k = std::__lg(r - l);
                ans = std::min({ans, a[k][l], a[k][r - (1 << k)]}, cmp);
            }
            return ans;
        } else {
            int x = B * (l / B);
            return ini[__builtin_ctzll(stk[r - 1] >> (l - x)) + l];
        }
    }
};

constexpr int inf = 2E9 + 10;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int N, M, P;
    std::cin >> N >> M >> P;
    
    std::vector<std::vector<int>> vec(N);
    for (int i = 0; i < M; i++) {
        int A, B, C;
        std::cin >> A >> B >> C;
        A--;
        B--;
        vec[B].push_back(C);
    }
    
    int R = 0;
    std::priority_queue<std::array<int, 3>, std::vector<std::array<int, 3>>, std::greater<>> pq;
    for (int x = 1; x < N; x++) {
        std::sort(vec[x].begin(), vec[x].end());
        vec[x].push_back(inf);
        pq.push({vec[x][0], x, 0});
        R = std::max(R, vec[x][0]);
    }
    
    std::vector<std::array<int, 2>> pts;
    while (!pq.empty() && R < inf) {
        auto [v, x, i] = pq.top();
        pq.pop();
        
        pts.push_back({v, R});
        i++;
        R = std::max(R, vec[x][i]);
        pq.push({vec[x][i], x, i});
    }
    
    std::vector<int> val(pts.size());
    for (int i = 0; i < pts.size(); i++) {
        val[i] = -pts[i][0] + pts[i][1];
    }
    RMQ<int> rmq(val);
    
    int Q;
    std::cin >> Q;
    for (int i = 0; i < Q; i++) {
        int x, y, c;
        std::cin >> x >> y >> c;
        
        int l = std::partition_point(pts.begin(), pts.end(),
            [&](auto p) {
                return p[1] < y;
            }) - pts.begin();
        int r = std::partition_point(pts.begin(), pts.end(),
            [&](auto p) {
                return p[0] <= x;
            }) - pts.begin();
        int ans = inf;
        if (l < r) {
            ans = x - y + rmq(l, r);
        }
        if (l > r) {
            ans = 0;
        }
        if (l <= r && l > 0) {
            ans = std::min(ans, x - pts[l - 1][0]);
        }
        if (l <= r && r < pts.size()) {
            ans = std::min(ans, pts[r][1] - y);
        }
        if (ans > c) {
            std::cout << "No\n";
        } else {
            std::cout << "Yes\n";
        }
    }
    
    return 0;
}