#include<iostream>
#include<cstdio>
using namespace std;

const int maxx=20003;
int father[maxx];
int n,m,q,ai,bi,ci,di;

int findd(int x)
{
    if(father[x]!=x)
        father[x]=findd(father[x]);
    return father[x];
}

void unionn(int x,int y)
{
    x=findd(x),y=findd(y);
    father[y]=x;
}

bool judgee(int x,int y)
{
    x=findd(x),y=findd(y);
    if(x==y)
        return true;
    else
        return false;
}

int main()
{
    freopen("relations.in","r",stdin);freopen("relations.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        father[i]=i;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&ai,&bi);
        unionn(ai,bi);
    }
    scanf("%d",&q);
    for(int i=1;i<=q;i++)
    {
        scanf("%d%d",&ci,&di);
        if(judgee(ci,di))
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}