#include <bits/stdc++.h>
using namespace std;
int n,m,q;
string s1;
map<string,string> fa;
string find(string x)
{
	if(fa[x]==x)
		return x;
	return fa[x]=find(fa[x]);
}
void merge(string x,string y)
{
	fa[find(x)]=find(y);
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%s",&s1);//程序错误处 
//		cin >> s1;
		fa[s1]=s1;
	}
	for(int i=1;i<=m;i++)
	{
		string x,y;
		cin >> x >> y;
		if(find(x)!=find(y))
			merge(x,y);
	}
	scanf("%d",&q);
	for(int i=1;i<=q;i++)
	{
		string x,y;
		cin >> x >> y;
		if(find(x)==find(y))
			printf("Yes.\n");
		else
			printf("No.\n");
	}
	return 0;
}