#include<iostream>
using namespace std;
const int maxn=5000+10;
int fa[maxn];
int findfa(int x)
{
if(x==fa[x])
return x;
return fa[x]=findfa(fa[x]);
}
void unionset(int x,int y)
{
int a=findfa(x);
int b=findfa(y);
if(a==b)
return;
fa[y]=a;
}
int main(){
int n,m,p;
cin>>n>>m>>p;
for(int i=1;i<=n;i++)
fa[i]=i;
for(int i=0;i<m;i++)
{
int a,b;
cin>>a>>b;
unionset(a,b);
}
for(int i=0;i<p;i++)
{
int c,d;
cin>>c>>d;
int a=findfa(c);
int b=findfa(d);
if(a==b)
cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}