#include <bits/stdc++.h> 

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

using namespace std;

typedef pair<int, int> pii;

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

int n, m, q, k, comp[N], base[LOG], mask[N];
int xr[N], bio[N], bioe[N], rep[N], ans[N];

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

int add(int x, bool flag){
	while(x && base[__lg(x)] != -1){
		x ^= space[base[__lg(x)]];
	}
	if(!flag){
	//	printf("x = %d\n", x);
		if(x) base[__lg(x)] = space.size();
		space.pb(x);
	}
	return x;
}

void dfs(int u){
	bio[u] = true;
	for(pii e : g[u]){
		int v = e.X, c = mask[e.Y];
		if(bio[v]){
			if(!bioe[e.Y]){
				bioe[e.Y] = true;
				add(xr[u] ^ xr[v] ^ c, 0);
			}
			continue;				
		}
		bioe[e.Y] = true; 
		xr[v] = xr[u] ^ c;
		//printf("xr[%d] = %d\n", v, xr[v]);
		dfs(v);
	}
}

void rec(int u, int c){
	bio[u] = true;
	comp[u] = c;
	for(pii e : g[u]){
		if(!bio[e.X]) rec(e.X, c);
	}
}

int ne(int x){
	for(int i = 0; i < k; i++){
		x ^= 1 << i;
	}
	return x;
}

int main(){
	scanf("%d%d%d%d", &n, &m, &k, &q);
	for(int i = 0; i < m; i++){
		int u, v, c;
		scanf("%d%d%d", &u, &v, &c);
		mask[i] = 1 << (c - 1);
		g[u].pb({v, i});
		g[v].pb({u, i});
	}
	int cnt = 0;
	for(int i = 1; i <= n; i++){
		if(!bio[i]){
			rec(i, cnt);
			rep[cnt] = i;
			cnt++;
		}
	}
	memset(bio, 0, sizeof(bio));
	for(int i = 0; i < q; i++){
		int s, t;
		scanf("%d%d", &s, &t);
		if(comp[s] == comp[t]) qs[comp[s]].pb({i, {s, t}});
	}
	for(int i = 0; i < cnt; i++){
		memset(base, -1, sizeof(base));
		space.clear();
		dfs(rep[i]);
		for(pair<int, pii> p : qs[i]) ans[p.X] = min(add(xr[p.Y.X] ^ xr[p.Y.Y], 1), add(ne(xr[p.Y.X] ^ xr[p.Y.Y]), 1)) == 0;
	}
	for(int i = 0; i < q; i++){
		if(ans[i] == 0) printf("No\n");
		else printf("Yes\n");
	}
	return 0;
}