#include<iostream>
#include<cstdio>
using namespace std;
#define maxn 20001
int father[maxn];
int n,m,i,q,c,d; 
int find(int x)
{
	if(father[x]==x) return x;
	father[x]=find(father[x]);
	return father[x];
}
void unionn(int x,int y)
{   int a,b;
	a=find(x);b=find(y);
	father[b]=a;
}
int main()
{   freopen("relations.in","r",stdin);
	freopen("relations.out","w",stdout);
	cin>>n>>m;
	for(i=1;i<=n;i++)
	father[i]=i;
	for(i=1;i<=m;i++)
	{
	    scanf("%d%d",&c,&d);
		unionn(c,d);
	}
	cin>>q;
	for(i=1;i<=q;i++)
	{
		scanf("%d%d",&c,&d);if(find(c)==find(d)) cout<<"Yes"<<endl;
	    else cout<<"No"<<endl;
	}
	
	
	return 0;
}