#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, m, q, f[200005], siz[200005], fa[200005][21], maxn[200005][21], nxt[400005], to[400005], head[200005], ccnt, w[400005], d[200005];
inline void add(int p, int q, int ww) {
//	cout << p << "!" << q << "!" << ww << "@\n";
	nxt[++ccnt] = head[p];
	w[ccnt] = ww;
	to[ccnt] = q;
	head[p] = ccnt;
}
struct node {
	int u, v, w;
} b[200005];
bool cmp(node p, node q) {
	return p.w < q.w;
}
inline int finds(int p) {
	return (f[p] == p) ? p : (f[p] = finds(f[p]));
}
inline void merge(int p, int q) {
	p = finds(p), q = finds(q);
	if (siz[p] > siz[q]) {
		siz[p] += siz[q];
		f[q] = p;
	} else {
		siz[q] += siz[p];
		f[p] = q;
	}
}
inline void dfs(int p, int q, int ww) {
	d[p] = d[q] + 1;
	fa[p][0] = q;
	maxn[p][0] = ww;
	for (int i = 1; i <= 20; i++) {
		fa[p][i] = fa[fa[p][i - 1]][i - 1];
		maxn[p][i] = max(maxn[p][i - 1], maxn[fa[p][i - 1]][i - 1]);
	}
	for (int i = head[p]; i; i = nxt[i]) {
		if (to[i] != q) {
			dfs(to[i], p, w[i]);
		}
	}
}
inline int solve(int p, int q) {
	int cnt = 0;
	if (p == q) return 0;
	if (d[p] < d[q]) swap(p, q);
	for (int i = 20; i >= 0; i--) {
		if (d[fa[p][i]] >= d[q]) {
			cnt = max(cnt, maxn[p][i]);
			p = fa[p][i];
		}
	}
	if (p == q) return cnt;
	for (int i = 20; i >= 0; i--) {
		if (fa[p][i] != fa[q][i]) {
			cnt = max(cnt, maxn[p][i]);
			cnt = max(cnt, maxn[q][i]);
			p = fa[p][i], q = fa[q][i];
		}
	}
	cnt = max(cnt, max(maxn[p][0], maxn[q][0]));
	return cnt;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> q;
	for (int i = 1; i <= m; i++) {
		cin >> b[i].u >> b[i].v >> b[i].w;
	}
	for (int i = 1; i <= n; i++) {
		f[i] = i, siz[i] = i;
	}
	sort(b + 1, b + m + 1, cmp);
	for (int i = 1; i <= m; i++) {
		if (finds(b[i].u) != finds(b[i].v)) {
			merge(b[i].u, b[i].v);
			add(b[i].u, b[i].v, b[i].w);
			add(b[i].v, b[i].u, b[i].w);
		}
	}
	dfs(1, 0, 0);
	int u, v, w;
//	for (int i = 1; i <= n; i++) {
//		for (int j = 0; j <= 2; j++) {
//			cout << fa[i][j] << "|" << maxn[i][j] << "[][]";
//		}
//		cout << "\n";
//	}
	for (int i = 1; i <= q; i++) {
		cin >> u >> v >> w;
//		cout << solve(u, v) << "[]\n";
		if (solve(u, v) > w) {
			cout << "Yes\n";
		} else {
			cout << "No\n";
		}
	}
}
//7 10 1
//2 1 9878
//3 2 7815
//4 1 2790
//5 2 22774
//6 1 17006
//7 6 25666
//2 2 4770
//2 1 30079
//3 4 26311
//2 3 6079
//7 1 9242