#include<iostream>  
#include<cstdio>
#include<cmath> 
using namespace std; 
int pre[20000+10]={0};
int find(int x)
{
    int r=x;
    while(pre[r]!=r)
		r=pre[r];
    return r;
}
int main()
{ 
    freopen("relations.in","r",stdin);      
    freopen("relations.out","w",stdout);
	int n,m;
	cin>>n>>m;
	//int rank[pre+10];
	int a,b;
	for(int i=1;i<=n;++i)
		pre[i]=i;
	for(int i=1;i<=m;++i)
	{
		scanf("%d%d",&a,&b);
		pre[b]=pre[a];
		int x=find(a),y=find(b);
		if(x!=y){
			pre[a]=pre[b];
		}
	}
	for(int i=1;i<=n;i++)
		pre[i]=find(pre[i]);
	int q;
	cin>>q;
	for(int i=1;i<=q;++i){
		scanf("%d%d",&a,&b);
		if(pre[a]==pre[b]){
			cout<<"Yes"<<endl;
			//cout<<pre[a]<<" "<<pre[b]<<endl;
		}
		else{
			cout<<"No"<<endl;
		}
	}
    return 0;  
}