import sys
import math
input = sys.stdin.readline
#sys.setrecursionlimit(10000000)
def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
            
def main():
    N,M=read_values()
    P=read_list()    
    for i in range(N):
        P[i]-=1
    C=[0]*N
    A=[0]*M
    B=[0]*M
    sM = M**0.5
    for i in range(M):
        A[i],B[i]=read_values()
        A[i]-=1
        B[i]-=1
        C[A[i]]+=1
        C[B[i]]+=1 
    MG = [[] for _ in range(N)]
    FG = [[] for _ in range(N)]

    for i in range(M):
        if C[B[i]]<sM:
            FG[A[i]].append(B[i])
        else:
            MG[A[i]].append(B[i])
        if C[A[i]]<sM:
            FG[B[i]].append(A[i])
        else:
            MG[B[i]].append(A[i])

    FCnt=[[] for _ in range(N)]
    for i in range(N):
        if C[i]>=sM:
            FCnt[i]=[0]*N
            for v in FG[i]:
                FCnt[i][P[v]]+=1    

    Q = int(input())
    for _ in range(Q):
        X,Y=read_index()
        if P[X]==P[Y]:
            print("No")
            continue
        cnt=0
        for v in MG[X]:
            cnt+=P[v]==P[Y]
        if C[X]<sM:
            for v in FG[X]:
                cnt+=P[v]==P[Y]
        else:
            cnt+=FCnt[X][P[Y]]
        if cnt:
            print("Yes")
            if C[X]<sM:
                for v in MG[X]:
                    FCnt[v][P[X]]-=1
                    FCnt[v][P[Y]]+=1
            P[X]=P[Y]
        else:
            print("No")

if __name__ == "__main__":
    main()