#include <bits/stdc++.h>
#define X first
#define Y second

using namespace std;
typedef long long llint;

const int maxn = 2e5+10;
const int base = 31337;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int logo = 20;
const int off = 1 << logo;
const int treesiz = off << 1;

int n, m, k, q;
vector< pair<int, int> > graph[maxn];
int comp[maxn], dep[maxn];
int t[maxn];
vector< int > cyc[maxn];
vector< pair<int, int> > bas[maxn];
bool used[maxn][31];

void dfs(int x, int parr, int c) {
	dep[x] = 1 + dep[parr];
	comp[x] = c;
	for (auto iter : graph[x]) {
		int tren = iter.X;
		int val = 1 << iter.Y;
		//if (tren == parr) continue;
		used[c][iter.Y] = true;

		if (comp[tren] == -1) {
			t[tren] = t[x] ^ val;
			dfs(tren, x, c);
		} else if (dep[x] >= dep[tren] && (t[x] ^ t[tren] ^ val) != 0) 
			cyc[c].push_back(t[x] ^ t[tren] ^ val);
	}
}

int main() {
	scanf("%d%d%d%d", &n, &m, &k, &q);
	for (int i = 0; i < m; i++) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c); c--;

		graph[a].push_back({b, c});
		graph[b].push_back({a, c});
	}

	memset(comp, -1, sizeof comp);
	memset(used, false, sizeof used);
	for (int i = 1; i <= n; i++) {
		if (comp[i] == -1) {
			dfs(i, 0, i);
			//printf("component: %d\n", i);
			//for (int tren : cyc[i]) printf("%d ", tren);
			//printf("\n");

			vector< int > bio(cyc[i].size(), -1);
			for (int j = 0; j < k; j++) {
				for (int l = 0; l < cyc[i].size(); l++) {
					if (bio[l] > -1) continue;

					int ac = cyc[i][l];
					if (ac & (1 << j)) {
						bio[l] = j;
						for (int t = 0; t < cyc[i].size(); t++) {
							if (t != l && (cyc[i][t] & (1 << j))) cyc[i][t] ^= ac;
						}
						break;
					}
				}
			}
			for (int j = 0; j < cyc[i].size(); j++) {
				if (bio[j] > -1) bas[i].push_back({cyc[i][j], bio[j]});
			}
		}
	}

	while (q--) {
		int a, b;
		scanf("%d%d", &a, &b);
		if (comp[a] != comp[b]) {
			printf("No\n");
			continue;
		}

		int c = comp[a];
		bool flag = true;
		for (int i = 0; i < k; i++) {
			if (!used[c][i]) flag = false;
		}
		if (!flag) {
			printf("No\n");
			continue;
		}

		int val = t[a] ^ t[b];
		for (auto iter : bas[c]) {
			int tr = iter.X;
			int bit = iter.Y;
			if (val & (1 << bit)) val ^= tr;
		}

		if (val == 0) {
			printf("Yes\n");
			continue;
		}

		val = t[a] ^ t[b];
		for (auto iter : bas[c]) {
			int tr = iter.X;
			int bit = iter.Y;
			if (!(val & (1 << bit))) val ^= tr;
		}

		if (val == ((1 << k) - 1)) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}