#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>

using namespace std;
typedef long long ll;
#define loop1(n) for(int loopt = 0; loopt < (n); loopt++)
#define loop2(i,n) for((i) = 0; (i) < (n); (i)++)
#define loop3(i,k,n) for((i) = (k); (i) < (n); (i)++)
#define GET_NAME_LOOP(_2,_3,NAME,...) NAME
#define loop(n,...) GET_NAME_LOOP(__VA_ARGS__,loop3,loop2,loop1)(n,__VA_ARGS__)

#define rloop1(n) for(int loopt = (n)-1; loopt >= 0; loopt--)
#define rloop2(i,n) for((i) = (n)-1; (i) >= 0; (i)--)
#define rloop3(i,k,n) for((i) = (k)-1; (i) >= (n); (i)--)
#define GET_NAME_RLOOP(_2,_3,NAME,...) NAME
#define rloop(n,...) GET_NAME_RLOOP(__VA_ARGS__,rloop3,rloop2,rloop1)(n,__VA_ARGS__)

#define outone cout << "First" << endl
#define outtwo cout << "Second" << endl
#define outyes cout << "Yes" << endl
#define outno cout << "No" << endl
#define outans cout << ans << endl
#define all(i) i.begin(),i.end()
//const ll mod =  998244353L;
//const ll mod = 1e9+7L;
//const double PI =3.14159265359d;
//const double E =2.718281828d;
class UnionFind{
    public:
    vector<int> par;
    vector<int> size;

    void init(int n){
        par.resize(n,-1);
        size.resize(n,1);
    }

    int find_root(int base){
        int now = base;
        while(true){
            if(par[now] == -1) break;
            now = par[now];
        }
        if(par[base] != -1) par[base] = now;
        return now;
    }

    void unite(int u, int v){
        int rootU = find_root(u);
        int rootV = find_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 is_same(int u, int v){
        if(find_root(u) == find_root(v)) return true;
        else return false;
    }
};
int main() {
    int n,q;
    cin >> n >> q;
    UnionFind uf;
    uf.init(n);
    int i;
    loop(i,0,n){
        int p;
        cin >> p;
        p--;
        if(p != -2) uf.unite(i,p);
    }
    while(q--){
        int a,b;
        cin >>a >> b;
        a--; b--;
        if(uf.is_same(a,b)) outyes;
        else outno;   
    }
}