#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ioclear std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout.tie(nullptr);
#define endl '\n'
#define CLOCK 1e3 * clock() / CLOCKS_PER_SEC

bool mem1;

using i64 = long long;
using pii = std::pair<int, i64>;
constexpr int mmax = 1E5 + 10;

int n, m, q, tot, first[mmax], nxt[mmax];
i64 v;
std::vector<std::pair<int, int>> que;
std::queue<int> Q;
std::array<int, mmax> ans, vis;

struct node
{
	int v;
	i64 w;
	node() {}
	node(int _v, i64 _w): v(_v), w(_w) {}
} edge[mmax];

void add(int u, int v, i64 w)
{
	edge[++tot] = node(v, w);
	nxt[tot] = first[u];
	first[u] = tot;
}

bool same(int x, int y)
{
	return vis[x] == vis[y];
}

void bfs(int s, i64 p)
{
	Q = std::queue<int>();
	Q.push(s);
	vis[s] = s;
	while(!Q.empty())
	{
		int u = Q.front();
		Q.pop();
		for(int i = first[u];i;i = nxt[i])
		{
			auto [v, w] = edge[i];
			if(!vis[v] && (w & p) == p)
				Q.push(v), /*dsu.merge(u, v),*/ vis[v] = vis[s];
		}
	}
}

void check(i64 val)
{
	std::fill(vis.begin() + 1, vis.begin() + n + 1, 0);
	// dsu.init(n + 1);
	for(int i = 1;i <= n;i++)
		if(!vis[i])
			bfs(i, val);
	for(int i = 0; auto [x, y]: que)
	{
		ans[i] = ans[i] || same(x, y);
		i++;
	}
}

void solve()
{
	std::cin >> n >> m >> q >> v;
	for(int i = 1;i <= m;i++)
	{
		int u, v;
		i64 w;
		std::cin >> u >> v >> w;
		add(u, v, w);
		add(v, u, w);
	}
	for(int i = 1;i <= q;i++)
	{
		int u, v;
		std::cin >> u >> v;
		que.emplace_back(u, v);
	}
	for(i64 p = v;p < (1ll << 60);p += p & -p)
		check(p);
	for(int i = 0;i < q;i++)
	{
		if(ans[i])
			std::cout << "Yes\n";
		else
			std::cout << "No\n";
	}
}

bool mem2;

int main()
{
    #ifdef ONLINE_JUDGE
    ioclear;
    #endif
    
    int t = 1;
    // std::cin >> t;
    while(t--)
		solve();
    
    // std::cerr << "USED " << CLOCK << " ms\n";
	// fprintf(stderr, "%.3lf MB", (&mem1 - &mem2) / 1048576.0);
}