#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(n);++i)

struct UnionFind{
    vector<ll> par;
    vector<ll> size;
    
    UnionFind(ll n){
        par.resize(n+1,-1);
        size.resize(n+1,1);
    }

    ll root(ll x){
        if(par[x]==-1) return x;
        return par[x]=root(par[x]);
    }

    void unite(ll u,ll v){
        ll RootU=root(u),RootV=root(v);
        if(RootU==RootV){
            return;
        }
        if(size[RootU]<size[RootV]){
            par[RootU]=RootV;
            size[RootV]+=size[RootU];
        }else{
            par[RootV]=RootU;
            size[RootU]+=size[RootV];
        }
        return;
    }

    bool same(ll u,ll v){
        return root(u)==root(v);
    }
};

int main(){

    ll n,q;
    cin >> n >> q;

    UnionFind uf(n);

    rep(i,n){
        ll p;
        cin >> p;
        if(p!=-1) uf.unite(i+1,p);
    }

    rep(i,q){
        ll a,b;
        cin >> a >> b;
        cout << (uf.same(a,b)?"Yes":"No") << endl;
    }

}