#include <iostream>
#include <cstdio>
using namespace std;
int n,m,q;
int pre[20001]={0};
int find(int x)
{
	/*int r=x;
	while(r!=pre[r])
		pre[r]=r;
	return r;*/
	if(x==pre[x])
		return x;
	pre[x]=find(pre[x]);
	return pre[x];
}
void join(int x,int y)
{
	int fx=find(x),fy=find(y);
	if(fx!=fy)
		pre[fx]=fy;
}
void in()
{
	cin>>n>>m;
	int a,b;
	for(int i=1;i<=n;i++)
		pre[i]=i;
	for(int i=1;i<=m;i++)
	{
		cin>>a>>b;
		join(a,b);
	}
	for(int i=1;i<=n;i++)
		pre[i]=find(pre[i]);
	/*for(int i=1;i<=n;i++)
		cout<<pre[i];*/
	cin>>q;
	for(int i=1;i<=q;i++)
	{
		cin>>a>>b;
		if(pre[a]==pre[b])
			cout<<"Yes"<<endl;
		else
			cout<<"No"<<endl;
	}
}
int main()
{
	freopen ("relations.in","r",stdin);
	freopen ("relations.out","w",stdout);
	in();
	return 0;
}