this

#include<bits/stdc++.h>
using namespace std;
int n,m,q;
int fa[5050];
int find(int x)
{
	if(fa[x]==x)return x;
	if(fa[x]==0)return fa[x]=x;
	int sb=x;
	while(fa[sb]!=sb)
		sb=fa[sb];
	int y=x;
	while(fa[y]!=y)
		y=fa[y],fa[y]=sb;	
	return sb;
}
int join(int x,int y)
{
	int fx=find(x),fy=find(y);
	if(fx!=fy)fa[fx]=fy;
	
}
int main()
{
	cin>>n>>m>>q;
	for(int i=1;i<=n;i++) fa[i]=i;
	for(int i=1;i<=m;i++)
	{
		int x,y;
		cin>>x>>y;
		join(x,y);
	}
	while(q--)
	{
		int x,y;
		cin>>x>>y;
		if(find(x)==find(y)) cout<<"Yes\n";
		else cout<<"No\n";
	}
	return 0;
}