#include <bits/stdc++.h>

using namespace std;

struct pnode {
    int to;
    int k;
    int jumps;
    bool operator<(const pnode& o) const {
        return jumps>o.jumps || jumps==o.jumps && k<o.k;
    }
};

int main() {
    cin.tie(NULL);
    ios::sync_with_stdio(false);
        freopen("space.in", "r", stdin);
    #ifndef LOCAL
        freopen("space.out", "w", stdout);
    #endif

    int N,M,S,K;
    cin>>N>>M>>S>>K;
    S--;
    vector<int> D(N,0);
    for(int i=1;i<N;i++) {
        cin>>D[i];
        D[i]--;
    }
    vector<vector<int>> adj(N);

    for(int i=0;i<M;i++) {
        int from,to;
        cin>>from>>to;
        from--,to--;
        adj[from].push_back(to);
        adj[to].push_back(from);
    }

    vector<int> bestk(N,-1);
    vector<int> res(N,INT_MAX);
    res[0]=0;

    priority_queue<pnode> pq;
    pq.push({S,K,0});
    int sti=0;
    while(!pq.empty()) {
        int v=pq.top().to;
        int k=pq.top().k;
        int j=pq.top().jumps;
        pq.pop();
        if(bestk[v]>k)continue;
        bestk[v]=k;
        res[v]=min(res[v],j);
        //cout<<"just set res[v] "<<v+1<<" = "<<res[v]<<endl;
        //cout<<"WE HERE "<<v+1<<" "<<j<<" "<<k<<endl;

        if(k>0) {
            for(int& n:adj[v]) {
                if(bestk[n]<k-1) {
                    pq.push({n,k-1,j==0?1:j});
                    //cout<<"adj push "<<v+1<<" "<<n+1<<endl;
                }
            }
        }

        int par = D[v];
        int pk=min(k+1,K);
        while(par>0) {
            for(int& n:adj[par]) {
                if(bestk[n]<pk-1) {
                    //cout<<" par push "<<par+1<<" "<<n+1<<" "<<pk-1<<endl;
                    pq.push({n,pk-1,j+1});
                }
            }
            res[par]=min(res[par],j);
            //cout<<"just set res[par] to"<<par+1<<" = "<<res[par]<<endl;
            pk=min(K,pk+1);
            par=D[par];
        }
    }

    int Q;
    cin>>Q;
    for(int i=0;i<Q;i++) {
        int q;
        cin>>q;
        q--;
        cout<<(res[q]==INT_MAX?-1:res[q])<<" ";
    }
    cout<<endl;

    return 0;
}