#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
// #define ATC
#define LL long long
#define eb emplace_back
using namespace std;

#ifdef ATC
#include <atcoder/all>
using namespace atcoder;
#endif

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 998244353;

namespace mystd {
    typedef pair<int, int> pii;
#define fi first
#define se second
#define MP make_pair
    template<typename T, typename _T>
    inline void inc (T &x, const _T &y) { x += y; (x >= mod) && (x -= mod); }
    template<typename T, typename _T>
    inline void dec (T &x, const _T &y) { x -= y; (x < 0) && (x += mod); }
    template<typename T, typename _T>
    inline void cmax (T &x, const _T &y) { (x < y) && (x = y); }
    template<typename T, typename _T>
    inline void cmin (T &x, const _T &y) { (x > y) && (x = y); }
    template<typename T>
    inline void write (const T &Arg) { cout << Arg; }
    template<typename T, typename ..._T>
    inline void write (const T &Arg, const _T &...Args) { cout << Arg, write(Args...); }
    template<typename T>
    inline void read (T &Arg) { cin >> Arg; }
    template<typename T, typename ..._T>
    inline void read (T &Arg, _T &...Args) { cin >> Arg, read(Args...); }
}

using namespace mystd;

const int N = 1e5 + 5, M = 64;
int n, m, q;
LL V;
vector<pii> G[N];

struct DSU {
    int par[N];
    inline void init (int o) {
        iota(par + 1, par + o + 1, 1);
    }
    inline int find (int x) {
        return x == par[x] ? x : par[x] = find(par[x]);
    }
    inline void merge (int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return;
        par[x] = y;
    }
    inline bool same (int x, int y) {
        return find(x) == find(y);
    }
} d[M];

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n >> m >> q >> V;
    for (int i = 1, u, v, w; i <= m; i++) {
        cin >> u >> v >> w;
        G[u].eb(v, w);
        G[v].eb(u, w);
    }
    for (int i = 61; ~i; i--)
        d[i].init(n);
    for (int i = 61; ~i; i--) {
        if (V >> i & 1 ^ 1) {
            LL x = ((V >> i) << i) + (1LL << i);
            for (int u = 1; u <= n; u++)
                for (auto [v, w] : G[u])
                    if ((w & x) == x) 
                        d[i].merge(u, v);
        }
    }
    while (q--) {
        static int u, v;
        cin >> u >> v;
        bool fl = 0;
        for (int i = 0; i <= 61; i++) fl |= d[i].same(u, v);
        cout << (fl ? "Yes\n" : "No\n");
    }
    #if LOCAL
    cout.flush();
    #endif
}
// I love WHQ!