#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define YES cout<<"Yes"<<endl;
#define NO cout<<"No"<<endl;
#define SetBit(x,k)(x|=(1ll<<k))
#define ClearBit(x,k)(x&=~(1ll<<k))
#define CheckBit(x,k)((x>>k)&1)
#define CC(x) cout<<"Case "<<++x<<": ";
//const int N = 1e6 + 10;
const int modulo = 10000007;
const int N=1e5+10;
int parent[N],sz[N];
map<ll,ll>vis;
void make(int v)
{
  parent[v]=v;
  sz[v]=1;
}
int find(int v)
{
  if(parent[v]==v)return parent[v];
  else return parent[v]=find(parent[v]);
}
void Union(int a,int b)
{
  a=find(a);
  b=find(b);
  if(a!=b)
  {
    if(sz[a]<sz[b])
    {
      swap(a,b);
     
    }
     parent[b]=a;
      sz[a]+=sz[b];
  }
}
int main()
{
  int n,mi,j,wt,total_cost=0,u,v,m,i;
  int q,V;
  cin>>n>>m>>q>>V;
  vector<pair<int,pair<int,int> > >edges;
  for(int i=1;i<=m;i++){
   int u,v,w;
   cin>>u>>v>>w;
   edges.push_back({w,{u,v}});
  }
  vector<int>need;
  need.push_back(V);
 ll ans=0;
 for(ll i=63;i>=0;i--){
    if(CheckBit(V,i)){
      SetBit(ans,i);
    }
    else{
      SetBit(ans,i);
      need.push_back(ans);
      ClearBit(ans,i);
    }
 }
 vector<pair<int,int>>query;
vis.clear();
while (q--)
{
 ll u,v;
 cin>>u>>v;
 query.push_back({u,v});
}
for(auto x:need){
  for(ll i=1;i<=n;i++)make(i);
  for(auto y:edges){
    if((y.first&x)>=V)Union(y.second.first,y.second.second);
  }
  for(ll i=0;i<query.size();i++){
    if(find(query[i].first)==find(query[i].second))vis[i]=1;
  }
}
for(ll i=0;i<query.size();i++){
  if(vis[i])YES
  else NO
}
}