#include<bits/stdc++.h>
using namespace std;
const int N=2e4+10;
bitset<N>a[2][N];
int p[N];
int n,m,x,y,q;
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++) {
		scanf("%d",&p[i]);
		a[0][p[i]][i]=1;
	}
	for (int i=1;i<=m;i++){
		scanf("%d%d",&x,&y);
		a[1][x][y]=1;
		a[1][y][x]=1;
	}
	scanf("%d",&q);
	for (int i=1;i<=q;i++){
		scanf("%d%d",&x,&y);
		if (p[x]!=p[y]){
			if ((a[0][p[y]]&a[1][x]).count()){
				puts("Yes");
				a[0][p[x]][x]=0;
				a[0][p[y]][x]=1;
				p[x]=p[y];
			}else puts("No");
		}else puts("No");
	}
}