#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

const int N=200005;
int par[N],siz[N];
void init_dsu(int n){for(int i=0; i<n; ++i) par[i]=i,siz[i]=1;}
int Find(int x){return x==par[x]?x:par[x]=Find(par[x]);}
bool Union(int x, int y){
    x=Find(x),y=Find(y);
    if(x==y) return 0;
    if(siz[x]<siz[y]) swap(x,y);
    siz[x]+=siz[y],par[y]=x;
    return 1;
}

int n,q;

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> n >> q;
    init_dsu(n);
    for(int i=0; i<n; ++i){
        int x; cin >> x;
        if(x!=-1) Union(i,x-1);
    }
    while(q--){
        int x,y; cin >> x >> y; x--,y--;
        cout << (Find(x)==Find(y)?"Yes":"No") << "\n";
    }
}