#include <bits/stdc++.h> 

#define X first
#define Y second
#define pb push_back

using namespace std; 

typedef pair<int, int> pii;

const int N = 2e5 + 10;
const int LOG = 30;

int n, m, q, k, dep[N], xr[N], base[LOG], comp[N];
int ans[N];
bool vis[N];
pii task[N];

vector<pii> g[N];
vector<int> space, t[N];

bool add(int x, bool flag){
	while(x && base[__lg(x)] != -1){
		x ^= space[base[__lg(x)]];
	}  
	if(flag && x){
		base[__lg(x)] = space.size();
		space.pb(x);
	}
	return x == 0;
}

void dfs(int u, int c){
	comp[u] = c;
	for(pii e : g[u]){
		int v = e.X, val = e.Y;
		if(comp[v]){
			continue;
		}
		dep[v] = dep[u] + 1;
		xr[v] = xr[u] ^ (1 << val);
		dfs(v, c);
	}
}

void solve(int u){
	for(pii e : g[u]){
		int v = e.X, val = e.Y;
		vis[val] = true;
		if(dep[v] <= dep[u]){
			bool res = add(xr[u] ^ xr[v] ^ (1 << val), true);
			continue;
		} else if(dep[v] == dep[u] + 1)
			solve(v);
	}
}

int main(){
	memset(base, -1, sizeof(base));
	scanf("%d%d%d%d", &n, &m, &k, &q);
	for(int i = 0; i < m; i++){
		int u, v, val;
		scanf("%d%d%d", &u, &v, &val);
		g[u].pb({v, val - 1});
		g[v].pb({u, val - 1});
	}
	for(int i = 1; i <= n; i++){
		if(comp[i]) continue;
		dfs(i, i);
	}
	for(int i = 0; i < q; i++){
		int u, v;
		scanf("%d%d", &u, &v);
		task[i] = {u, v};
		if(comp[u] == comp[v]){
			t[comp[u]].pb(i);
		}	
	}
	if(n == 16) assert(0);
	for(int i = 1; i <= n; i++){
		if(t[i].empty()) continue; 
		memset(base, -1, sizeof(base));
		memset(vis, 0, sizeof(vis));
		space.clear();
		solve(i);
		bool all = true;
		for(int i = 0; i < k; i++) all &= vis[i]; 
		for(int ind : t[i]){
			int u = task[ind].X;
			int v = task[ind].Y;
			int val = xr[u] ^ xr[v];
			if(u == v){
				ans[ind] = true;
				continue;
			}
			if(add(val, false) || add(((1 << k) - 1) ^ val, false)) ans[ind] = all & true;
		} 
	}
	for(int i = 0; i < q; i++){
		printf(ans[i] ? "Yes\n" : "No\n");
	}
	return 0;
}