#include <bits/stdc++.h> using namespace std; int main(){ int N, Q; cin >> N >> Q; vector<int> P(N); for (int i = 0; i < N; i++){ cin >> P[i]; if (P[i] != -1){ P[i]--; } } vector<vector<int>> c(N); for (int i = 0; i < N; i++){ if (P[i] != -1){ c[P[i]].push_back(i); } } vector<int> r(N, -1); for (int i = 0; i < N; i++){ if (P[i] == -1){ queue<int> q; q.push(i); while (!q.empty()){ int v = q.front(); q.pop(); r[v] = i; for (int w : c[v]){ q.push(w); } } } } for (int i = 0; i < Q; i++){ int A, B; cin >> A >> B; A--; B--; if (r[A] == r[B]){ cout << "Yes" << endl; } else { cout << "No" << endl; } } }