#include<bits/stdc++.h>
using namespace std;
int f[5010],n,m,p;
int find(int x){//查 
	if(f[x]==x) return x;
	else return f[x]=find(f[x]);
} 
void merge(int x,int y){//和并 
	f[find(y)]=find(x);
	return;
}
int main(){
	cin>>n>>m>>p;
	for(int i=1;i<=n;i++) f[i]=i;//每个人为自己老大 
	while(m--){
		int x,y;
		scanf("%d%d",&x,&y);
		merge(x,y);
	}
	while(p--){
		int x,y;
		scanf("%d%d",&x,&y);
		if(find(x)==find(y)) cout<<"YES"<<endl;
		else cout<<"NO"<<endl;
	}
}