#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> plll;
const int N = 1e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

int n, m, Q, V;
int fa[N][70];
vector<plll> e;

int find(int x, int o) {
    return fa[x][o] == x ? x : fa[x][o] = find(fa[x][o], o);
}

void build(ll v, int o) {
    for (int i = 1; i <= n; ++i) fa[i][o] = i;
    for (auto[a, b, w]: e) {
        if ((w & v) == v) {
            // cout << a << ' ' << b << el;
            fa[find(a, o)][o] = find(b, o);
        }
    }
    // cout << o << "----\n";
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m >> Q >> V;
    while (m--) {
        ll u, v, w;
        cin >> u >> v >> w;
        e.push_back({u, v, w});
    }
    for (ll i = V, j = 0; i < 1ll << 60; i += i & -i, ++j) {
        build(i, j);
    }
    while (Q--) {
        int u, v;
        cin >> u >> v;
        bool f = 0;
        for (ll i = V, j = 0; i < 1ll << 60; i += i & -i, ++j) {
            if (find(u, j) == find(v, j)) {
                // cout << u << ' ' << v << ' ' << V << el;
                // cout << find(u, j) << ' ' << find(v, j) << el;
                f = 1; break;
            }
        }
        cout << (f ? "Yes\n" : "No\n");
    }
}