#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double

#define pii pair<int, int>

#define INF 1e9

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#ifdef CB
	freopen("be1.txt", "r", stdin);
//	freopen("out.txt", "w", stdout);
#endif
	int N, M, T, DB, E;
	cin >> N >> M >> T >> DB >> E;
	vector<vector<int>> gj(N + 1);
	vector<vector<int>> gt(N + 1);
	for (int i = 0; i < M; i++) {
		int a, b, s;
		cin >> a >> b >> s;
		gj[a].push_back(b);
		gj[b].push_back(a);
		if (s == 2) {
			gt[a].push_back(b);
			gt[b].push_back(a);
		}
	}
	deque<int> q;
	vector<int> dt(N + 1, INF);
	dt[T] = 0;
	q.push_back(T);
	while (!q.empty()) {
		int i = q.front();
		q.pop_front();
		for (int j : gt[i]) {
			if (dt[j] == INF && j != E) {
				dt[j] = dt[i] + 1;
				q.push_back(j);
			}
		}
	}
	vector<int> v(N + 1);
	vector<int> w(N + 1);
	v[E] = 1;
	q.push_back(E);
	while (!q.empty()) {
		int i = q.front();
		q.pop_front();
		for (int j : gj[i]) {
			int k = (i == E) ? j : w[i];
			if (v[j] == 0) {
				v[j] = v[i] + 1;
				w[j] = k;
				q.push_back(j);
			}
			else {
				if (w[j] != k) {
					w[j] = j;
				}
			}
		}
	}
	while (DB--) {
		int i;
		cin >> i;
		if (dt[w[i]] <= v[i] - v[w[i]]) {
			cout << w[i] << '\n';
		}
		else {
			cout << 0 << '\n';
		}
	}
	return 0;
}