#include<bits/stdc++.h>
using namespace std;
const int N=200001;
vector<int> v[N];
int fa[N],n,m,t;
int find(int x){
    if(fa[x]==x) return x;
    return fa[x]=find(fa[x]);
}
void merge(int x,int y){
	int fax=find(x),fay=find(y);
	if(fax==fay) return;
	fa[fax]=fay;
	return;
}
int main(){
	cin>>n>>m;
    for(int i=1;i<=n;i++) fa[i]=i;
    for(int i=0;i<m;i++){
        int x,y;
		cin>>x>>y;
        merge(x,y);
    }
	cin>>t;
    while(t--){
        int x,y;
		cin>>x>>y;
        if(find(x)==find(y)) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
	return 0;
}

样例过了