#include<bits/stdc++.h>
#define rep(i,p,q) for (ll i=(p);i<=(q);i++)
#define pre(i,p,q) for (ll i=(p);i>=(q);i--)
#define ll long long
using namespace std;
const int N=100010,M=5e5+5; struct edge{ll x,y,z;}E[M]; 
ll n,m,q,V,flag,cnt,p,x,y,fa[65][N],pos[65];
ll find(ll i,ll x) {return fa[i][x]==x?x:fa[i][x]=find(i,fa[i][x]);}
int main() {
	scanf("%lld%lld%lld%lld",&n,&m,&q,&V);
	pre(i,60,1) if (V&(1ll<<i-1)) pos[++cnt]=i;
	rep(i,1,m) scanf("%lld%lld%lld",&E[i].x,&E[i].y,&E[i].z);
	pre(i,60,1) {
        flag=0;
        rep(j,1,n) fa[i][j]=j;
        if (V&(1ll<<i-1)) p++,flag=1;
        rep(j,1,m) if (E[j].z&(1ll<<i-1)) {
            x=find(i,E[j].x),y=find(i,E[j].y);
            if (x!=y) {
            	//printf("i:%lld x:%lld y:%lld\n",i,x,y);
                if (!flag||p==1) fa[i][x]=y;
                else if (fa[pos[p-1]][x]==fa[pos[p-1]][y]) fa[i][x]=y;
            }
        }
    }
    //pre(i,4,1) rep(j,1,n) printf("%lld%c",fa[i][j]," \n"[j==n]);
    for (;q--;cout<<1) {
        scanf("%lld%lld",&x,&y);
        flag=1;
        pre(i,60,1) {
        	if (!(V&(1ll<<i-1))&&find(i,x)==find(i,y)) break;
			if (V&(1ll<<i-1)&&find(i,x)!=find(i,y)) {flag=0; break;}
		}
        puts(flag?"Yes":"No");
    }
}