五十求调

#include<bits/stdc++.h>
using namespace std;
int fa[10000];
int n,m,p;
struct s{
	int a;
	int b;
}qqgx[10000],qqgx2[10000];
int find(int a) {
	if (fa[a] == a) return a;
	fa[a] = find(fa[a]);
	return fa[a];
}
int main()
{
	cin >> n >> m >> p;
	for (int i = 1;i <= m;i++) {
		fa[i] = i;
	}
	for (int i = 1;i <= m;i++) {
		cin >> qqgx[i].a >> qqgx[i].b;
		if (qqgx[i].a > qqgx[i].b) fa[find(qqgx[i].a)] = find(qqgx[i].b);
		else fa[find(qqgx[i].b)] = find(qqgx[i].a);
	}
	for (int i = 1;i <= p;i++) {
		cin >> qqgx2[i].a >> qqgx2[i].b;
	}
	for (int i = 1;i <= p;i++) {
		if (find(qqgx2[i].a) == find(qqgx2[i].b)) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}