#include<bits/stdc++.h>
using namespace std;
int father[20086],n,m;
int find(int x){
	if(father[x]!=x)father[x]=find(father[x]);
	return father[x];
//	return find(father[x]);
}
void unionn(int x,int y){
	x=find(x);y=find(y);
	if(x==y)return;
	father[y]=x;
}
void work(){
	int x,y,c;cin>>n>>m;
	for(int i=1;i<=n;i++)father[i]=i;
	for(int i=1;i<=m;i++){
		cin>>x>>y;unionn(x,y);
	} 
	cin>>c;
	for(int i=1;i<=c;i++){
		cin>>x>>y;
		if(find(x)==find(y))cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
}
int main(){
	work();
}