#include<iostream>
using namespace std;
const int N = 2e5 + 10;
int n, m, k, p[N];
int find(int x) {
if (p[x] == x) return x;
return p[x] = find(p[x]);
}
int main() {
cin >> n >> m >> k;
for (int i = 1; i <= n; i++)p[i] = i;
while (m--) {
int a, b; cin >> a >> b;
p[find(a)] = find(b);
}
while (k--) {
int a, b;
cin >> a >> b;
if (find(a) == find(b)) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}
结果: