#include <stdio.h>
int father[5010],rank[5010];
void get(int size)
{
for(int i=1;i<=size;i++)
{
father[i]=i;
rank[i]=0;
}
}
int find(int x)
{
if(x!=father[x])
father[x]=find(father[x]);
return father[x];
}
void union1(int x,int y)
{
int fx=find(x);
int fy=find(y);
if(fx==fy) return;
if(rank[fx]>rank[fy])
father[fy]=fx;
else
{
father[fx]=fy;
rank[fx]++;
}
}
int main()
{
int n,m,p,x,y;
while(scanf("%d %d %d",&n,&m,&p)!=EOF)
{
get(n);
for(int i=0;i<m;i++)
{
scanf("%d %d",&x,&y);
union1(x,y);
}
for(int j=0;j<p;j++)
{
scanf("%d %d",&x,&y);
if(find(x)==find(y))
printf("Yes\n");
else
printf("No\n");
}
}
return 0;
}