#include<bits/stdc++.h>
using namespace std;
#define int long long
// #define int __int128
#define re read()
#define pr(x) print(x)
#define fup(a, b, c, d) for(int a = (b); a <= (c); a += (d))
#define fdo(a, b, c, d) for(int a = (b); a >= (c); a -= (d))
typedef long long ll;
typedef pair<int , int> PII;
typedef map<int , int> MII;
const int inf = 0x3f3f3f3f, N = 2e6 + 10, M = 4e5 + 10, mod = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f3f;

__int128 read()
{
    __int128 x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9'){
        if(ch == '-')
            f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9'){
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}

void print(__int128 x)
{
    if(x < 0){
        putchar('-');
        x = -x;
    }
    if(x > 9)
        print(x / 10);
    putchar(x % 10 + '0');
}

int p[N];
int find(int x)//返回x的祖宗节点
{
	if(p[x] != x) return find(p[x]);
    return x;
}

int n, m, q, V;
vector<PII> ve;
struct edge
{
    int u, v, w;
};
vector<edge> ed;
bool st[N];

void solve()
{
    cin >> n >> m >> q >> V;

    fup(i, 1, m, 1) {
        int u, v, w;
        cin >> u >> v >> w;
        ed.push_back({u, v, w});
    }

    fup(i, 1, q, 1) {
        int u, v;
        cin >> u >> v;
        ve.push_back({u, v});
    }

    fdo(i, 60, 0, 1) {
        if((V >> i) & 1) continue ;

        fup(j, 1, n, 1) p[j] = j;

        int res = ((V >> i) + 1) << i;

        for(auto x : ed) {
            int u, v, w;
            u = x.u, v = x.v, w = x.w;
            if((res & w) != res) continue ;

            u = find(u), v = find(v);
            if(u != v) {
                p[u] = v;
            }
        }

        fup(j, 0, q - 1, 1) {
            int u, v;
            u = ve[j].first, v = ve[j].second;
            u = find(u), v = find(v);
            if(u == v) {
                st[j] = true;
            }
        }
    }

    fup(j, 1, n, 1) p[j] = j;

    int res = V;

    for(auto x : ed) {
        int u, v, w;
        u = x.u, v = x.v, w = x.w;
        if((res & w) != res) continue ;

        u = find(u), v = find(v);
        if(u != v) {
            p[u] = v;
        }
    }

    fup(j, 0, q - 1, 1) {
        int u, v;
        u = ve[j].first, v = ve[j].second;
        u = find(u), v = find(v);
        if(u == v) {
            st[j] = true;
        }
    }

    fup(j, 0, q - 1, 1) {
        if(st[j]) cout << "Yes\n";
        else cout << "No\n";
    }
    
}

signed main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);

    int _ = 1;
    // cin >> _;
    while(_ --)
    {
        solve();
    }
}