#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll n,m,q,v;
ll fa[110000][70];
bool vis[70];

ll find(ll xx,ll yy){
	if (fa[xx][yy]==xx) return xx;
	else{
		fa[xx][yy]=find(fa[xx][yy],yy);
		return fa[xx][yy];
	}
}

int main(){
	freopen("Paths.in","r",stdin);
	freopen("Paths.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>m>>q>>v;
	for (int i=1;i<=n;i++){
		for (int j=0;j<=62;j++){
			fa[i][j]=i;
		}
	}
	for (int j=60;j>=0;j--){
		if (v&(1ll<<j)){
			vis[j]=1;
		}
	}
    for (int i=1;i<=m;i++){
    	ll u,v,w;
    	cin>>u>>v>>w;
    	for (int j=60;j>=0;j--){
    		bool c=(w&(1ll<<j));
    		if (!vis[j]&&c) fa[find(u,j)][j]=find(v,j);
    		else if (vis[j]&&!c) break;
		}
		if ((w&v)==v) fa[find(u,61)][61]=find(v,61);
	}
	for (int i=1;i<=q;i++){
		ll u,v;
		cin>>u>>v;
		bool c=0;
		for (int j=61;j>=0;j--){
			if (find(u,j)==find(v,j)){
				c=1;
				break;
			}
		}
		if (c) cout<<"Yes\n";
		else cout<<"No\n";
	}
    return 0;
}