#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define endl '\n'
#define int long long
typedef long double f128;
typedef long long i64;
typedef unsigned long long u64;
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f, mod = 1e9 + 7;
const i64 inf = 2e18;
//-------------------------------------------
const int N = 1e5+10,M = 5e5+10;
vector<PII> h[N];
array<int, 2> Q[M];
int lowbit(int x)
{
  return x & (-x);
}
void solve()
{
  int n, m, q, V;
  cin >> n >> m >> q >> V;
  for (int i = 1; i <= m; i++)
  {
    int x, y, w;
    cin >> x >> y >> w;
    h[x].push_back({y, w});
    h[y].push_back({x, w});
  }
  for (int i = 1; i <= q; i++)
    cin >> Q[i][0] >> Q[i][1];
  vector<bool> ans(q + 1);
  auto check = [&](int x)
  {
    vector<int> col(n + 1);
    auto bfs = [&](int z)
    {
      queue<int> q;
      q.push(z);
      col[z] = z;
      while (!q.empty())
      {
        auto t = q.front();
        q.pop();
        for (auto a : h[t])
        {
          if ((a.y & x) == x && !col[a.x])
          {
            col[a.x] = z;
            q.push(a.x);
          }
        }
      }
    };
    for (int i = 1; i <= n; i++)
    {
      if (!col[i])
        bfs(i);
    }
    for (int i = 1; i <= q; i++)
    {
      if (col[Q[i][0]] == col[Q[i][1]])
        ans[i] = true;
    }
  };

  for (int i = V; i < (1LL << 60); i += lowbit(i))
    check(i);
  for (int i = 1; i <= q; i++)
  {
    if (ans[i])
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
}
signed main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int T = 1;
  // cin >> T;
  for (int i = 1; i <= T; i++)
    solve();
  return 0;
}