#include <cstdio>
#include <utility>
#include <vector>
#define debug(...) fprintf(stderr, __VA_ARGS__)

#define int long long

inline int rd() {
	int x = 0, f = 1, c = getchar();
	while (((c - '0') | ('9' - c)) < 0)
		f = c != '-', c = getchar();
	while (((c - '0') | ('9' - c)) > 0)
		x = x * 10 + c - '0', c = getchar();
	return f ? x : -x;
}

using pii = std::pair<int, int>;

const int N = 1e5;
const int M = 5e5;
const int LOGN = 61;

int n, m, q, V;
struct edge {
	int u, v, w;
} e[M + 5];
pii qu[M + 5];
bool win[M + 5], ans[M + 5];

std::vector<int> g[N + 5];
int col[N + 5], cid;
void dfs(int u, int c) {
	col[u] = c;
	for (int v : g[u]) {
		if (!col[v]) dfs(v, c);
	}
}

signed main() {
	n = rd(), m = rd(), q = rd(), V = rd();
	for (int i = 1; i <= m; i++) e[i] = {rd(), rd(), rd()};
	for (int i = 1; i <= q; i++) qu[i] = {rd(), rd()}, ans[i] = true;

	for (int p = LOGN; p >= 0; p--) {
		int S = V >> p;
		for (int i = 1; i <= m; i++) {
			auto [u, v, w] = e[i];
			int T = w >> p;
			if ((w >> p & 1) && (T & S) == S) g[u].emplace_back(v), g[v].emplace_back(u);
		}
		for (int i = 1; i <= n; i++) {
			if (!col[i]) dfs(i, ++cid);
		}

		int c = V >> p & 1;
		if (!c) {
			for (int i = 1; i <= q; i++) {
				auto [u, v] = qu[i];
				if (col[u] == col[v]) {
					// debug("%d, %d\n", p, i);
					win[i] = true;
				}
			}
		} else {
			for (int i = 1; i <= q; i++) {
				auto [u, v] = qu[i];
				if (col[u] != col[v] && !win[i]) {
					// debug("%d, %d\n", p, i);
					ans[i] = false;
				}
			}
		}
		for (int i = 1; i <= n; i++) col[i] = 0, g[i].clear();
		cid = 0;
	}

	for (int i = 1; i <= m; i++) {
		auto [u, v, w] = e[i];
		if ((V & w) == V) g[u].emplace_back(v), g[v].emplace_back(u);
	}
	for (int i = 1; i <= n; i++) {
		if (!col[i]) dfs(i, ++cid);
	}
	for (int i = 1; i <= q; i++) {
		auto [u, v] = qu[i];
		if (col[u] != col[v]) ans[i] = false;
	}

	for (int i = 1; i <= q; i++) {
		puts(ans[i] ? "Yes" : "No");
	}
	return 0;
}