#include<iostream>  
#include<cstdio>
#include<cmath> 
#include<cstring>  
#include<algorithm>  
using namespace std; 
int n,m,f[20001],q,a,b;
int main(){ 
    freopen("relations.in","r",stdin);        
    freopen("relations.out","w",stdout);      
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)f[i]=i;
	for(int i=1;i<=m;i++){
		scanf("%d%d",&a,&b);
		if(b<a){
			int k=a;a=b;b=k;
		}
		if(f[b]==b)f[b]=f[a];
		else {
			if(f[a]==a){
				f[a]=f[b];
			}
			else{
			    int p=b;
			    while(f[p]!=p){
				    f[p]=f[a];
			    	p=f[p];
			    }
			    f[p]=f[a];
		    }
		}
	}
	cin>>q;
	for(int i=1;i<=q;i++){
		scanf("%d%d",&a,&b);
		int p=a,j=b;
		while(f[p]!=p)p=f[p];
		while(f[j]!=j)j=f[j];
		if(p==j)printf("Yes");
		else printf("No");
		cout<<endl;
	}
    return 0;  
}