#include <iostream>
#include <iomanip>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <bitset>
#include <atcoder/all>
#define rep(i,n) for(int i = 0; i < n; i++)

using namespace std;
using namespace atcoder;
using ll = long long;

int main() {
	int n, q;
	cin >> n >> q;
	dsu uf(n);

	vector<int> p(n);
	for (int i = 0; i < n; i++) {
		cin >> p[i];
		p[i]--;

		if (p[i] >= 0) {
			uf.merge(i, p[i]);
		}
	}

	for (int i = 0; i < q; i++) {
		int a, b;
		cin >> a >> b;
		a--; b--;

		if (uf.same(a, b)) cout << "Yes" << endl;
		else cout << "No" << endl;
	}
}