#include<iostream>
#include<cmath>
using namespace std;
int n,m,p;
const int N=5005;
int f[N];
int find(int x){
	if(f[x]==x)return x;
	else return f[x]=find(f[x]);
}
int main(){
	cin>>n>>m>>p;
	for(int i=1;i<=n;i++){
		f[i]=i;
	}	
	while(m--){
		int x,y;
		cin>>x>>y;		
		int fx=find(x),fy=find(y);
		f[fx]=fy;
	}
	while(p--){
		int x,y;
		cin>>x>>y;		
		int fx=find(x),fy=find(y);
		if(fx==fy){
			cout<<"Yes\n";
		}
		else cout<<"No\n";
	}
	return 0;
}