import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

n, m = LI()
pp = LI1()
to = [0]*n
for _ in range(m):
    u, v = LI1()
    to[u] |= 1 << v
    to[v] |= 1 << u

mem = [0]*n
for u, p in enumerate(pp): mem[p] |= 1 << u

for _ in range(II()):
    x, y = LI1()
    p, q = pp[x], pp[y]
    if p == q:
        print("No")
    else:
        if to[x] & mem[q]:
            print("Yes")
            mem[p] ^= 1 << x
            mem[q] ^= 1 << x
            pp[x] = q
        else:
            print("No")