n,m = map(int,input().split())
p = list(map(int,input().split()))

graph = [[0]*(n//60+5) for i in range(n)]
for i in range(m):
    a,b = map(int,input().split())
    a -= 1
    b -= 1
    graph[a][b//60] |= 1<<(b%60)
    graph[b][a//60] |= 1<<(a%60)

world = [[0]*(n//60 + 5) for i in range(n+1)]
for i in range(n):
    world[p[i]][i//60] |= 1<<(i%60)

q = int(input())
for i in range(q):
    x,y = map(int,input().split())
    x -= 1
    y -= 1
    wy = p[y]
    now = 0
    if p[x] == wy:
        print('No')
        continue
    ok = 0
    for j in range(n//60+5):
        if world[wy][j] & graph[x][j] != 0:
            ok = 1
            break
    if ok:
        print('Yes')
        world[p[x]][x//60] -= 1<<(x%60)
        world[p[y]][x//60] |= 1<<(x%60)
        p[x] = p[y]
    else:
        print('No')