#include <bits/stdc++.h>
using namespace std;

using LL = __int128;
using ll = long long;
using ldb = long double;
using vi = vector < int >;
using pii = pair < int, int >;
using ull = unsigned long long;
#define pb push_back
#define ve vector < edge >
#define lowbit(x) ((x) & -(x))
#define sz(x) (int((x).size()))
#define all(a) (a).begin(), (a).end()
#define me(a, b) memset(a, b, sizeof(a))
#define L(i, j, k) for (int i = j; i <= int(k); i++)
#define R(i, j, k) for (int i = j; i >= int(k); i--)
#define qio() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
namespace io {
	int read() {
		int x = 0, f = 1; char ch = getchar();
		while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
		while (ch >= '0' && ch <= '9') {
			assert(10ll * x + (ch ^ '0') <= INT_MAX);
			x = x * 10 + (ch ^ '0'), ch = getchar();
		} return x * f;
	}
	template < class T = int > void read(T& x) {
		x = 0; int f = 1; char ch(getchar());
		while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); }
		while (ch >= '0' && ch <= '9') { x = x * 10 + (ch ^ '0'), ch = getchar(); } x *= f;
	}
} using io::read;

template < class T > ostream& operator << (ostream& out, vector < T > v) {
	out << '[';  if (!v.empty()) { L(i, 0, v.size() - 2) out << v[i] << ','; out << v[v.size() - 1]; } return out << ']';
}
#define DEBUG
namespace Dbg {
	template < class T > void dbg(char *f, T t) { cerr << f << '=' << t << endl; }
	template < class T, class ...Ar > void dbg(char *f, T x, Ar... y) {
		while (*f != ',') { cerr << *f++; } cerr << '=' << x << ','; dbg(f + 1, y...);
	}
}
#ifdef DEBUG
	#define gdb(...) cerr << "gdb " << __LINE__ << ": ", Dbg::dbg((char*)#__VA_ARGS__,__VA_ARGS__)
	#define debug cerr << "debug: " << __LINE__ << '\n'
	#define msg(x) cerr << x << '\n'
#else
	#define gdb(...) void()
	#define debug void()
	#define msg() void()
#endif

/* ================================= */

const int N = 1e5 + 5; // Adjust
const int M = 5e5 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;

int n, m, q, u[M], v[M], qu[M], qv[M], fa[N];
ll V, w[M];
bool ans[N];

int main() {
	n = read(), m = read(), q = read(), read(V);
	L(i, 1, m)
		u[i] = read(), v[i] = read(), read(w[i]);
	L(i, 1, q)
		qu[i] = read(), qv[i] = read();

	function < int(int) > find = [&](int x) {
		return x == fa[x] ? x : fa[x] = find(fa[x]);
	};

	if (V == 0) {
		L(i, 1, n)
			fa[i] = i;
		L(i, 1, m) {
			int fu = find(u[i]), fv = find(v[i]);
			if (fu != fv)
				fa[fu] = fv;
		}
		L(i, 1, q) 
			if (find(qu[i]) == find(qv[i]))
				puts("No");
			else
				puts("Yes");
		exit(0);
	}

	R(i, 61, 0) {
//		if (V >> i & 1)
//			continue;
		ll mask = (V != 0) ? (V | 1ll << i) : 0;
		L(j, 1, n)
			fa[j] = j;

		L(j, 1, m)
			if (((w[j] >> i) & (mask >> i)) >= (mask >> i)) {
				int fu = find(u[j]), fv = find(v[j]);
				if (fu != fv)
					fa[fu] = fv;
			}

		L(j, 1, q)
			if (find(qu[j]) == find(qv[j]))
				ans[j] = 1;

		if (V == 0)
			break;
	}

	L(i, 1, q)
		puts(ans[i] ? "Yes" : "No");
	return 0;
}