#include<bits/stdc++.h>
using namespace std;
int fa[1000002];
int find(int x)
{
    if(fa[x]==x) return x;
    else return fa[x]=find(fa[x]);
}
int main()
{
    freopen("relations.in","r",stdin);
    freopen("relations.out","w",stdout);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++) fa[i]=i;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        int a1=find(a);
        int a2=find(b);
        if(a1!=a2)
            fa[a1]=a2;
    }
    int q;
    cin>>q;
    for(int i=1;i<=q;i++)
    {
        int a,b;
        cin>>a>>b;
        int a1=find(a);
        int a2=find(b);
        if(a1==a2) cout<<"Yes"<<endl; 
        else cout<<"No"<<endl;
    }
    return 0;
    }