#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9+7;

vector<int> tavok(int start, vector<vector<int>>& graf, int n){
    vector<int> ki(n+1, INF);
    vector<bool> volt(n+1, false);
    queue<int> q;
    q.push(start);
    volt[start] = true;
    int akt, akt_meret = 1, kov_meret = 0, tav = 0;
    while(!q.empty()){
        akt = q.front();
        akt_meret--;
        ki[akt] = tav;
        q.pop();

        for(int kov : graf[akt]){
            if(volt[kov]) continue;
            q.push(kov);
            kov_meret++;
            volt[kov] = true;
        }

        if(akt_meret == 0){
            swap(akt_meret, kov_meret);
            tav++;
        }
    }

    return ki;
}

void dfs(int akt, int szulo, int& ido, vector<vector<int>>& graf, vector<int>& be_ido, vector<int>& kis, vector<bool>& volt, set<int>& vago){
    be_ido[akt] = kis[akt] = ido++;
    volt[akt] = true;
    //cout << "nez " << akt << " " << szulo << "\n";

    int gyerek_db = 0;
    for(int kov : graf[akt]){
        if(kov == szulo) continue;
        if(volt[kov]){
            kis[akt] = min(kis[akt], be_ido[kov]);
        }
        else{
            //cout << "indit " << akt << " " << kov << "\n";
            dfs(kov, akt, ido, graf, be_ido, kis, volt, vago);
            gyerek_db++;
            kis[akt] = min(kis[akt], kis[kov]);

            if(be_ido[akt] <= kis[kov] && szulo != -1){
                vago.insert(akt);
            }
        }
    }
    if(szulo == -1 && gyerek_db > 1){
        vago.insert(akt);
    }
}

vector<int> legjobb_ut(int kezd, vector<vector<int>>& graf, int n){
    queue<int> q;
    vector<bool> volt(n+1, false);
    q.push(kezd);
    volt[kezd] = true;
    int akt, akt_meret = 1, kov_meret = 0, tav = 0;
    vector<int> ki(n+1, -1);
    while(!q.empty()){
        akt = q.front();
        q.pop();
        akt_meret--;

        for(int kov : graf[akt]){
            if(volt[kov]) continue;
            ki[kov] = akt;
            volt[kov] = true;
            kov_meret++;
            q.push(kov);
        }

        if(akt_meret == 0){
            swap(akt_meret, kov_meret);
            tav++;
        }
    }
    return ki;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m, t, j_db, lyuk;
    cin >> n >> m >> t >> j_db >> lyuk;
    vector<vector<int>> tom_graf(n+1, vector<int>());
    vector<vector<int>> jerry_graf(n+1, vector<int>());

    int a, b, c;
    for(int i = 0; i < m; i++){
        cin >> a >> b >> c;
        jerry_graf[a].push_back(b);
        jerry_graf[b].push_back(a);
        if(c == 2){
            if(a == lyuk || b == lyuk) continue;
            tom_graf[a].push_back(b);
            tom_graf[b].push_back(a);
        }
    }

    int ido = 0;
    vector<int> be_ido(n+1, INF);
    vector<int> kis(n+1, INF);
    vector<bool> volt(n+1, false);
    set<int> vago;
    dfs(lyuk, -1, ido, jerry_graf, be_ido, kis, volt, vago);
/*
    cout << "vagok: ";
    for(int x : vago){
        cout << x << " ";
    }
    cout << "\n";
*/
    vector<int> tom_tav = tavok(t, tom_graf, n);
    vector<int> jo_utak = legjobb_ut(lyuk, jerry_graf, n);

    int x;
    for(int i = 0; i < j_db; i++){
        cin >> x;
        int elkapja = 0;

        // mely vagopontok vannak jerry es a lyuk kozott - itt tudja Tom biztosan elkapni
        int tav = 0;
        int akt = x;
        while(akt != lyuk){
            //cout << "itt jar: " << akt << "\n";
            if(tom_tav[akt] <= tav && vago.count(akt)){
                elkapja = akt;
            }

            akt = jo_utak[akt];
            tav++;
        }

        cout << elkapja << "\n";
    }


}