class UnionFind():
            
    def __init__(self, n):
        self.count = n
        self.par = [-1]*n
        self.siz = [1]*n
    def root(self,x):
        if(self.par[x] == -1):
            return x
        else:
            self.par[x] = self.root(self.par[x])
            return self.par[x]
    def issame(self,x,y):
        return self.root(x) == self.root(y)
    def unite(self,x,y):
        x = self.root(x)
        y = self.root(y)
        if(x == y):
            return False
        if(self.siz[x]<self.siz[y]):
            x,y = y,x
        self.par[y] = x
        self.siz[x] += self.siz[y]
        self.count -= 1
        return True
    def size(self,x):
        return self.siz[self.root(x)]
N,Q = map(int,input().split())
P = list(map(int,input().split()))
uf = UnionFind(N)
for i in range(N):
    if P[i] != -1:
        uf.unite(i,P[i]-1)

for _ in range(Q):
    A,B = map(int,input().split())
    print("Yes" if uf.issame(A-1,B-1) else "No")