#pragma GCC optimize("O3")
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 100000;
const int MAXK = 20;

int arr[MAXN];
vector<int> edges[MAXN];

//deque<tuple<int, int, bool, int>> dq;
deque<int> dp;
deque<int> df;
deque<bool> djmp;
deque<int> dd;
int dist[MAXN][MAXK + 1][2];
bool bio[MAXN][MAXK + 1][2];

void go(int p, int f, bool jmp, int d, bool add)
{
//	cerr<<' '<<p + 1<<' '<<f<<' '<<jmp<<' '<<d<<' '<<dist[p][f][jmp]<<endl;
	if (dist[p][f][jmp] == -1)
	{
//		dist[p][f][jmp] = d;
		if (add)
		{
//			dq.emplace_back(p, f, jmp, d);
			dp.emplace_back(p);
			df.emplace_back(f);
			djmp.emplace_back(jmp);
			dd.emplace_back(d);
		}
		else
		{
			dist[p][f][jmp] = d;
//			dq.emplace_front(p, f, jmp, d);
			dp.emplace_front(p);
			df.emplace_front(f);
			djmp.emplace_front(jmp);
			dd.emplace_front(d);
		}
	}
}

int main()
{
	freopen("space.in", "r", stdin);
	freopen("space.out", "w", stdout);
	memset(dist, -1, sizeof dist);
	
	int n, m, s, k;
	
	cin>>n>>m>>s>>k;
	--s;
	
	for (int i = 1; i < n; ++i)
	{
		cin>>arr[i];
		--arr[i];
	}
	
	while (m--)
	{
		int a, b;
		cin>>a>>b;
		--a, --b;
		edges[a].push_back(b);
		edges[b].push_back(a);
	}
	
	go(s, 1, false, 0, false);
	while (!dp.empty())
	{
		int p, f, d;
		bool jmp;
//		tie(p, f, jmp, d) = dq.front();
		p = dp.front();
		f = df.front();
		jmp = djmp.front();
		d = dd.front();
//		dq.pop_front();
		dp.pop_front();
		df.pop_front();
		djmp.pop_front();
		dd.pop_front();
		
		if (bio[p][f][jmp])
			continue;
		dist[p][f][jmp] = d;
		bio[p][f][jmp] = true;
//		cerr<<p + 1<<' '<<f<<' '<<jmp<<' '<<d<<endl;
		
		go(arr[p], min(f + 1, k), false, d, false);
		if (f) for (int q: edges[p])
		{
			go(q, f - 1, true, d + !jmp, !jmp);
		}
	}
	
	int q;
	cin>>q;
	while (q--)
	{
		int x;
		cin>>x;
		--x;
		int sol = -1;
		for (int i = 0; i <= k; ++i) for (int j = 0; j < 2; ++j) if (dist[x][i][j] != -1 && (sol == -1 || dist[x][i][j] < sol))
			sol = dist[x][i][j];
		cout<<sol<<' ';
	}
	cout<<endl;
}