import sys
from collections import deque, Counter
from math import gcd, log10, pi, sqrt, ceil
from bisect import bisect, bisect_left, bisect_right, insort
from typing import Iterable, TypeVar, Union, Tuple, Iterator, List
import copy
import heapq
import itertools
import math
import random
from fractions import Fraction
from functools import lru_cache, partial, cmp_to_key
import operator
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
mod = 998244353
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]

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, Q = read_values() 
    P = read_list()

    top = [-1] * N
    def dfs(i):
        if top[i] != -1:
            return

        if P[i] == -1:
            top[i] = i
            return

        p = P[i] - 1
        dfs(p)
        top[i] = top[p]

    for i in range(N):
        if top[i] != -1:
            continue
        dfs(i)

    for _ in range(Q):
        a, b = read_index()
        print("Yes" if top[a] == top[b] else "No")


if __name__ == "__main__":
    main()