#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n + 1); i++)
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;

void dfs(vector<vector<int>> &g, int a, int b, vector<bool> &seen){
    seen[a] = true;

    for(int x: g[a]){
        if(seen[x])continue;
        dfs(g, x, b, seen);
    }
}

int main()
{
    int n, q;
    cin >> n >> q;
    vector<vector<int>> g(n, vector<int>());
    rep(i, n)
    {
        int a;
        cin >> a;
        if (a == -1)
        {
            g[i].push_back(i);
            continue;
        }
        g[i].push_back(a - 1);
        g[a - 1].push_back(i);
    }
    rep(i, q)
    {
        int a, b;
        cin >> a >> b;
        a--; b--;
        vector<bool> seen(n, false);

        dfs(g, a, b, seen);
        if(seen[a] && seen[b]){
            cout << "Yes" << endl;
        }
        else{
            cout << "No" << endl;
        }
        
    }
}