def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    n = int(data[idx])
    idx += 1
    q = int(data[idx])
    idx += 1
    p = list(map(int, data[idx:idx + n]))
    idx += n
    
    # Adjust p to be 1-based
    p = [0] + p  # p[1..n] are the given P_1 to P_n
    
    root = [0] * (n + 1)  # 1-based
    
    for i in range(1, n + 1):
        if root[i] == 0:
            stack = []
            current = i
            while True:
                stack.append(current)
                parent = p[current]
                if parent == -1:
                    r = current
                    break
                if root[parent] != 0:
                    r = root[parent]
                    break
                current = parent
            for node in stack:
                root[node] = r
    
    # Process queries
    output = []
    for _ in range(q):
        a = int(data[idx])
        idx += 1
        b = int(data[idx])
        idx += 1
        if root[a] == root[b]:
            output.append("Yes")
        else:
            output.append("No")
    print('\n'.join(output))

if __name__ == '__main__':
    main()