#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define pii pair<int, int>
#define tii array<int, 3>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define accu(x) accumulate(all(x), (int)0)

int n, m, q, V;
vector<tii> edges;

struct dsu
{
    int par[100005];

    int find(int x)
    {
        if (par[x] == 0 || par[x] == x)
            return par[x] = x;
        return par[x] = find(par[x]);
    }

    void join(int x, int y)
    {
        x = find(x);
        y = find(y);
        if (x == y)
            return;
        par[x] = y;
    }
} pre[65];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    cin >> n >> m >> q >> V;
    for (int i = 1; i <= m; i++)
    {
        int u, v, w;
        cin >> u >> v >> w;
        edges.push_back({u, v, w});
    }

    int curr = 0;
    for (int i = 61; i >= 0; i--)
    {
        bool temp = 0;
        if ((V >> i) & 1)
        {
            curr |= 1LL << i;
        }
        else
        {
            temp = 1;
            curr |= 1LL << i;
        }

        if (temp)
        {
            for (auto it = edges.begin(); it != edges.end(); ++it)
            {
                int u = (*it)[0], v = (*it)[1], w = (*it)[2];
                if ((w & curr) == curr)
                {
                    pre[i].join(u, v);
                }
            }
            curr ^= 1LL << i;
        }
    }

    while (q--)
    {
        int u, v;
        cin >> u >> v;
        bool hobe = 0;
        for (int i = 61; i >= 0; i--)
        {
            if (pre[i].find(u) == pre[i].find(v))
            {
                hobe = 1;
                break;
            }
        }
        if (hobe)
            cout << "Yes\n";
        else
            cout << "No\n";
    }

    return 0;
}