import sys input = sys.stdin.readline n,m=map(int,input().split()) p=list(map(int,input().split())) from collections import defaultdict class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) uf=UnionFind(n) for _ in range(m): a,b=map(int,input().split()) uf.union(a-1,b-1) memo=[] memocnt=[] dic={} tmp=0 for l in list(uf.all_group_members().values()): se=set() cnt=defaultdict(int) for i in l: se.add(p[i]) cnt[p[i]]+=1 dic[i]=tmp memo.append(se) memocnt.append(cnt) tmp+=1 q=int(input()) for _ in range(q): x,y=map(int,input().split()) x-=1 y-=1 if p[x]==p[y]: print("No") continue if p[y] not in memo[dic[x]]: print("No") continue memocnt[dic[x]][p[x]]-=1 if memocnt[dic[x]][p[x]]==0: memo[dic[x]].remove(p[x]) p[x]=p[y] memocnt[dic[x]][p[x]]+=1 memo[dic[x]].add(p[x]) print("Yes")