#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x) {
	short f = 1; char c = getchar(); x = 0;
	for(; c < '0' || c > '9'; c = getchar())
		if (c == '-') f = -1;
	for (; c >= '0' && c <= '9'; c = getchar())
		x = (x << 1) + (x << 3) + (c - '0');
	x *= f;
	return ;
}
constexpr int N = 5e5 + 5;
using ll = long long;
int n, m, q;
ll V;
vector<array<ll,2>> g[N];
int id[N], idx;
int a[N][2];
int stk[N], top;
void dfs(int s, ll val) {
	idx++;
	stk[++top] = s;
	while (top) {
		int u = stk[top--];
		for (auto [v, w] : g[u]) {
			if (((w & val) == val) && !id[v])
				stk[++top] = v, id[v] = idx;
		}
	}
}
bool ans[N];
void check(ll val) {
	for (int i = 1; i <= n; i++)
		id[i] = 0;
	idx = 0;
	for (int i = 1; i <= n; i++)
		if (!id[i])
			dfs(i, val);
	for (int i = 1; i <= q; i++)
		ans[i] |= id[a[i][0]] == id[a[i][1]];
}
signed main() {
	read(n), read(m), read(q), read(V);
	for (int i = 1; i <= m; i++) {
		int u, v;
		ll w;
		read(u), read(v), read(w);
		g[u].push_back({v, w});
		g[v].push_back({u, w});
	}
	for (int i = 1; i <= q; i++) 
		read(a[i][0]), read(a[i][1]);
	if (!V) check(V);
	else {
		for (ll t = V; t < (1ll << 60); t += (t & (-t)))
			check(t);
	}
	for (int i = 1; i <= q; i++)
		puts(ans[i] ? "Yes" : "No");
}