#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m,k,q;

int cnt = 1;
int head[200005];
struct eg{
	int to,w,nxt;
}edge[400005];

void make(int u,int v,int w){
	edge[++cnt].to = v;
	edge[cnt].w = w;
	edge[cnt].nxt = head[u];
	head[u] = cnt;
}

int ww[200005][32];
void insert(int id,int val){
	per(i,k - 1,0){
		if(((val >> i) & 1) == 0) continue;
		if(!ww[id][i]){
			ww[id][i] = val;
			return;
		}
		val ^= ww[id][i];
	}
}

int qry(int id,int val){
	per(i,k - 1,0) chkmin(val,val ^ ww[id][i]);
	return val;
}

int getval(int c){
	c = (1 << (c - 1));
	if(c == (1 << (k - 1))) c--;
	return c;
}

int vis[200005],dep[200005],occ[200005][35];
void dfs(int u,int I,int c){
	vis[u] = c;
	for(int i = head[u];i;i = edge[i].nxt){
		int v = edge[i].to;
		if(i == (I ^ 1)) continue;

		occ[c][edge[i].w] = 1;
		if(!vis[v]){
			dep[v] = dep[u] ^ getval(edge[i].w);
//			printf("%d -> %d %d\n",u,v,dep[v]);
			dfs(v,i,c);
		}else{
//			printf("simple cir %d\n",dep[u] ^ dep[v] ^ edge[i].w);
			insert(c,dep[u] ^ dep[v] ^ getval(edge[i].w));
		}
	}
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d%d%d%d",&n,&m,&k,&q);
	rep(i,1,m){
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		make(u,v,w);make(v,u,w);
	}

	rep(u,1,n){
		if(vis[u]) continue;
		dfs(u,0,u);
	}

	rep(i,1,q){
		int u,v;
		scanf("%d%d",&u,&v);
		if(vis[u] != vis[v]){
			printf("No\n");
			continue;
		}

		int flg = 1;
		rep(j,1,k) flg &= occ[vis[u]][j];
		if(!flg){
			printf("No\n");
			continue;
		}
		if(!qry(vis[u],dep[u] ^ dep[v])) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}