N,Q = map(int,input().split())
P = list(map(int,input().split()))

import sys
sys.setrecursionlimit(10 ** 8)
parent= list(range(N + 1))

def find(i):
    if parent[i] == i:return i
    parent[i] = find(parent[i])
    return parent[i]
def unite(i,j):
     I = find(i)
     J = find(j)
     if I == J:return False
     parent[i] = J
     parent[I] = J
     return True
def isSame(i,j):
     return find(i) == find(j)

for i in range(N):
    if P[i] == -1:continue
    unite(i + 1,P[i])

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