#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <queue>
using namespace std;

int n,m,s,k;
int dad[200111];
bool TFO[200111][22];
int dst[200111][22];
deque< pair<int,int> > mydeq;

vector<int> Graph[200111];

int ans[200111];

int MIN(int a,int b)
{
    if (a < b)
        return a;
    else
        return b;
}

void BFS01()
{
    int i;

    memset(dst,-1,sizeof(dst));
    memset(ans,-1,sizeof(ans));

    mydeq.push_back(make_pair(s,1));
    dst[s][1] = 0;

    while(!mydeq.empty())
    {
        pair<int,int> tp = mydeq.front();
        mydeq.pop_front();

        if (TFO[tp.first][tp.second])
            continue;

        TFO[tp.first][tp.second] = true;

        int ver = tp.first;
        int energy = tp.second;
        bool freejump = false;

        if (ver > n)
        {
            ver -= n;
            freejump = true;
        }

        //cout<<"Visit "<<ver<<" with energy "<<energy<<" and free jump status "<<freejump<<endl;
        //cout<<"Distance = "<<dst[tp.first][tp.second]<<endl<<endl;

        if (dst[tp.first][tp.second] < ans[ver] || ans[ver] == -1)
            ans[ver] = dst[tp.first][tp.second];

        ///Jump to father always free
        if (ver != 1)
        {
            if (!TFO[ dad[ver] ][MIN(k, energy+1)])
            {
                mydeq.push_front(make_pair(dad[ver], MIN(k, energy+1)));
                if (dst[ dad[ver] ][ MIN(k, energy+1) ] == -1 || dst[ dad[ver] ][ MIN(k, energy+1) ] > dst[tp.first][tp.second])
                {
                    dst[ dad[ver] ][ MIN(k, energy+1) ] = dst[tp.first][tp.second];
                }
            }
        }
        ///

        if (energy >= 1)
        {
            for (i=0;i<Graph[ver].size();i++)
            {
                int nver = Graph[ver][i];

                int cost = 1;
                if (freejump)
                    cost = 0;

                int neng = energy - 1;

                if (!TFO[nver+n][neng])
                {
                    if (freejump)
                        mydeq.push_front(make_pair(nver+n,neng));
                    else
                        mydeq.push_back(make_pair(nver+n,neng));

                    if (dst[nver+n][neng] == -1 || dst[nver+n][neng] > dst[tp.first][tp.second] + cost)
                    {
                        dst[nver+n][neng] = dst[tp.first][tp.second] + cost;
                    }
                }
            }
        }
    }
}

int main()
{
    freopen("space.in","r",stdin);
    freopen("space.out","w",stdout);

    int i;

    scanf("%d %d %d %d",&n,&m,&s,&k);

    for (i=2;i<=n;i++)
    {
        scanf("%d",&dad[i]);
    }

    for (i=1;i<=m;i++)
    {
        int a,b;

        scanf("%d %d",&a,&b);

        Graph[a].push_back(b);
        Graph[b].push_back(a);
    }

    BFS01();

    int q;
    scanf("%d",&q);

    for (i=1;i<=q;i++)
    {
        int a;

        scanf("%d",&a);

        printf("%d",ans[a]);

        if (i != q)
            printf(" ");
    }
    printf("\n");

    return 0;
}