#include<iostream>
#include<cstdio> 
#include<cmath>
using namespace std;
int we[20001]={0};
int find(int x)
{
	int rr=x;
	while(we[rr]!=rr)
	{
		rr=we[rr];
	}
	return rr;
}
void join(int x,int y)
{
	int fx=find(x);
	int fy=find(y);
	if(fx!=fy)
		we[fx]=we[fy];
	return;
}
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++)
	{
		we[i]=i;
	}
	int ci,di;
	for(int i=1;i<=m;i++)
	{
		cin>>ci>>di;
		we[di]=we[ci];
	}
	for(int i=1;i<=n;i++)
	{
		we[i]=find(we[i]);
	}
	int q;
	int ei,fi;
	cin>>q;
	for(int i=1;i<=q;i++)
	{
		cin>>ei>>fi;
		if(we[ei]==we[fi])
		{
			cout<<"Yes";
		}
		else
			cout<<"No";
	}
	return 0;
}