#include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;

void bfs_tom(
    int t, const vector<vector<pair<int,bool>>> &adj,
    vector<int> &limit)
{
    queue<int> q;
    q.push(t);
    limit[t] = 0;

    while (!q.empty()) {
        int v = q.front();
        q.pop();

        for (auto p : adj[v]) {
            if (p.second && limit[p.first] == INT_MAX) {
                limit[p.first] = limit[v] + 1;
                q.push(p.first);
            }
        }
    }
}

void smecher(
    int e, const vector<vector<pair<int,bool>>> &adj,
    const vector<int> &limit,
    vector<int> &rem)
{
    priority_queue<
        pair<int, int>, // (rem, v)
        vector<pair<int,int>>,
        less<pair<int,int>>> pq;

    rem[e] = limit[e]-1;
    pq.push({rem[e], e});

    while (!pq.empty()) {
        int remv = pq.top().first;
        int v = pq.top().second;
        pq.pop();

        if (rem[v] == remv) {
            for (auto p : adj[v]) {
                int sz = p.first;
                if (rem[sz] == -1 && limit[sz] > 0) {
                    rem[sz] = min(remv-1, limit[sz]-1);
                    pq.push({rem[sz],sz});
                }
            }
        }
    }
}

int main()
{
    int n, m, t, p, e;
    cin >> n >> m >> t >> p >> e;

    vector<vector<pair<int,bool>>> adj(n+1);
        // .first == ki a szomszéd
        // .second == true, ha tom is mehet ott

    for (int i = 0; i < m; i++) {
        int a, b, tip;
        cin >> a >> b >> tip;
        bool mehet = (tip == 2);

        adj[a].push_back({b, mehet});
        adj[b].push_back({a, mehet});
    }

    vector<int> limit(n+1, INT_MAX);

    bfs_tom(t, adj, limit);

    vector<int> rem(n+1, -1);

    smecher(e, adj, limit, rem);

    for (int i = 0; i < p; i++) {
        int start;
        cin >> start;

        if (rem[start] >= 0)
            cout << "IGEN\n";
        else
            cout << "NEM\n";
    }

    return 0;
}