#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 100005
#define M 500005
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,q,V,d,op,f[N],x,y,z;
bool ans[N];
struct edge{int u,v,w;}e[M];
struct question{int u;int v;}qu[M];
int fd(int x){return x^f[x]?f[x]=fd(f[x]):x;}
void mg(int x,int y){f[fd(x)]=fd(y);} 
int fp(int a,int n,int mod){
    int ans=1;
    while(n){
        if(n&1)ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("Paths.in","r",stdin);freopen("Paths.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    n=read();m=read();q=read();V=read();
    fo(i,1,m)e[i]={read(),read(),read()};
    fo(i,1,q)qu[i]={read(),read()};
    for(int i=60,s=0;~i;i--){
        s|=1ll<<i;
        if(s<V)continue;
        fo(j,1,n)f[j]=j;
        fo(j,1,m)
            if((e[j].w&s)==s)
                mg(e[j].u,e[j].v);
        fo(j,1,q)
            if(fd(qu[j].u)==fd(qu[j].v))
                ans[j]=1;
        s^=1ll<<i;
    }
    fo(i,1,q)printf("%s\n",ans[i]?"Yes":"No"); 
    return 0;
}