#include<bits/stdc++.h>
using namespace std;
inline int re()
{
    int f=1,num=0;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') num=num*10+c-'0',c=getchar();
    return num*f;
}
const int N=20010;
int n,m,q;
int fa[N],sz[N];
int get(int x)
{
    if(fa[x]==x) return x;
    return fa[x]=get(fa[x]);
}
void merge(int x,int y)
{
    x=get(x);y=get(y);
    if(x==y) return;
    if(sz[x]>sz[y]) swap(x,y);
    fa[x]=y;sz[y]+=sz[x];
    return;
}
int main()
{
    freopen("relations.in","r",stdin);
    freopen("relations.out","w",stdout);
    n=re();m=re();
    for(int i=1;i<=n;i++) fa[i]=i,sz[i]=1;
    while(m--) merge(re(),re());
    q=re();
    while(q--) if(get(re())==get(re())) printf("Yes\n");else printf("No\n");
    return 0;
}