def find(x):
    if P[x] == x: return x
    else:
        P[x] = find(P[x]) #経路圧縮
        return P[x]
        # return find(P[x]) #経路圧縮なし

def same(x,y):
    return find(x) == find(y)

def unite(x,y):
    x = find(x)
    y = find(y)
    if x == y: return 0
    if x > y: x,y = y,x
    P[y] = x

N,Q = map(int,input().split())
PI = list(map(int,input().split()))
P = [i for i in range(N+1)]

for i,p in enumerate(PI,start = 1):
    if p == -1:
        continue
    unite(i,p)

for _ in range(Q):
    a,b = map(int,input().split())
    if same(a,b):
        print("Yes")
    else:
        print("No")