#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1009;
const int M = 5e5 + 1009;
#define endl "\n"
int n, m, q, x[M], y[M], a[M], b[M], ans[M], fa[N];
long long v, z[M];
int find(int x) {
    if(fa[x] == x) return x;
    return fa[x] = find(fa[x]);
}
void check(long long V) {
    for(int i = 1; i <= n; i ++) fa[i] = i;
    for(int i = 1; i <= m; i ++) {
        if((z[i] & V) == V) fa[find(x[i])] = find(y[i]);
    }
    for(int i = 1; i <= q; i ++) {
        if(ans[i]) continue;
        if(find(a[i]) == find(b[i])) ans[i] = 1;
    }
}
void work() {
    cin >> n >> m >> q >> v;
    for(int i = 1; i <= m; i ++) {
        cin >> x[i] >> y[i] >> z[i];
    }
    for(int i = 1; i <= q; i ++) cin >> a[i] >> b[i];
    long long V = 0;
    for(int i = 59; i >= 0; i --) {
        if((z[i] >> i) & 1) V |= (1ll << i);
        else check(V | (1ll << i));
    }
    check(V);
    for(int i = 1; i <= q; i ++)
        cout << (ans[i] ? "Yes" : "No") << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int Case = 1;
    while(Case --) work();
    return 0;
}