import sys
sys.setrecursionlimit(500000)
class UF:
  def __init__(self, n):
    self.root = [i for i in range(n)]
    self.subt = [1] * n

  def find(self, x):
    if self.root[x] == x:
      return x
    else:
      self.root[x] = self.find(self.root[x])
      return self.root[x]

  def union(self, x, y):
    x, y = self.find(x), self.find(y)
    x, y = min(x, y), max(x, y)
    if x != y:
      self.subt[x] += self.subt[y]
    self.root[y] = x

  def size(self, x):
    return self.subt[self.find(x)]

n, q = map(int, input().split())
p = list(map(lambda x: int(x)-1, input().split()))
uf = UF(n)
for i in range(n):
  if p[i] < 0:
    continue
  uf.union(i, p[i])
for _ in range(q):
  a, b = map(lambda x: int(x)-1, input().split())
  print("Yes" if uf.find(a) == uf.find(b) else "No")