#include <bits/stdc++.h>
#define rep(i, j, k) for (int i = j; i <= k; i++)
#define per(i, j, k) for (int i = j; i >= k; i--)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128;
using pii = pair<int, int>;
using pll = pair<long, long>;
using ai3 = array<int, 3>;
const int N = 2e5 + 5, mod = 998244353;
ll n, m, q, V;
struct dsu
{
    vector<int> p, sz;
    void init(int n)
    {
        p.resize(n + 1, 0);
        sz.resize(n + 1, 1);
        iota(p.begin(), p.end(), 0);
    }
    int find(int x) {return p[x] == x ? x : p[x] = find(p[x]);}
    void merge(int x, int y)
    {
        x = find(x), y = find(y);
        if (x == y) return ;
        p[x] = y, sz[y] += sz[x];
    }
    int siz(int x) {return sz[find(x)];}
    bool same(int x, int y) {return find(x) == find(y);}
} ds[61];
bool check(int u, int v)
{
    per(i, 60, 0)
    {
        if (ds[i].same(u, v)) return 1;
    }
    return 0;
}
int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n >> m >> q >> V;
    rep(i, 0, 60) ds[i].init(n);
    while (m--)
    {
        ll u, v, w;
        cin >> u >> v >> w;
        per(i, 59, 0)
        {
            int x = w >> i & 1, y = V >> i & 1;
            if (!x && !y) continue;
            if (x && x == y) ds[i].merge(u, v);
            else if (x) ds[i].merge(u, v);
            else break;
        }
        if (w & V == V) ds[60].merge(u, v);
    }
    while (q--)
    {
        int u, v;
        cin >> u >> v;
        if (check(u, v)) cout << "Yes\n";
        else cout << "No\n";
    }
    return 0;
}