#include<bits/stdc++.h>
using namespace std;
int n,m,p;
int fa[50005];
int find(int x){
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
int main(){
	freopen("relations.in","r",stdin);
	freopen("relations.out","w",stdout); 
	scanf("%d%d%d",&n,&m,&p);
	for(int i = 1;i<=n;i++) fa[i]=i;
	for(int i = 1;i<=m;i++){
		int x,y; scanf("%d%d",&x,&y);
		fa[find(x)]=find(y);
	}
	while(p--){
		int x,y;
		scanf("%d%d",&x,&y);
		if(find(x)==find(y)) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
}