#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define Mp make_pair
#define sep ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define kill(res) cout << res << '\n', exit(0);
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 3e3 + 50;
const ll M = 1e6 + 50;
const ll Mod = 1e9 + 7;
int n, m, k, s, par[2*N], h[2*N], cnt[M], res[2*N];
vector<int> adj[2*N], cyc[2*N];
void pre(int v){
for(int i: cyc[v]) cnt[i]++;
for(int u: adj[v]) pre(u);
if(v <= n) for(int i: cyc[v]) cnt[i]--;
else{
int dist = k - h[v];
for(int i = 1; i * i <= dist; i++) if(dist % i == 0) res[v] |= (cnt[i] > 0) | (cnt[dist / i] > 0);
for(int i: cyc[v]) cnt[i]--;
}
}
int main(){
fast_io;
cin >> n >> m >> k >> s; s++;
int l;
for(int i = 1; i <= n+m; i++){
cin >> par[i] >> l;
h[i] = h[par[i]] + l + 1;
adj[par[i]].pb(i);
if(i > n) res[i] = (h[i] == k);
}
par[0] = -1;
for(int i = 0; i <= n; i++){
int v = i;
while(v >= 0){
if(h[i] - h[v] + s < M) cyc[v].pb(h[i] - h[v] + s);
v = par[v];
}
}
pre(0);
vector<int> height;
for(int i = 0; i <= n; i++) height.pb(h[i]);
sort(all(height));
for(int i = n+1; i <= n+m; i++){
int v = par[i]; l = h[i] - h[par[i]];
while(v >= 0){
int dist = k - l - s;
int idx = lower_bound(all(height), dist) - height.begin();
if(idx <= n && height[idx] == dist) res[i] = 1;
if(par[v] >= 0) l += h[v] - h[par[v]];
v = par[v];
}
cout << (res[i] ? "YES\n" : "NO\n");
}
}
