#include<bits/stdc++.h>
using namespace std;
int fa[20005];
int n,m,p;
int getfa(int x)
{
    return fa[x]==x?x:fa[x]=getfa(fa[x]);
}
void merge(int x,int y)
{
    int u,v;
    u=getfa(x);
    v=getfa(y);
    fa[v]=u;
}
int main()
{
	freopen("relations.in","r",stdin);
	freopen("relations.out","w",stdout);
    for(int i=1;i<=5001;i++)fa[i]=i;
    scanf("%d%d",&n,&m);
    for(int i=1,a,b;i<=m;i++)
    {
        scanf("%d%d",&a,&b);
        merge(a,b);
    }
    scanf("%d",&p);
    for(int i=1,a,b;i<=p;i++)
    {
        scanf("%d%d",&a,&b);
        if(getfa(a)==getfa(b))printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}