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

vector<int> bfsTom(const vector<vector<int>>& g, int start) {
    vector<int> dist(g.size(), -1);
    queue<int> q;
    dist[start] = 0;
    q.push(start);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (int v : g[u]) {
            if (dist[v] == -1) {
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
    }
    return dist;
}

bool canEscape(const vector<vector<int>>& g,
               const vector<int>& tomDist,
               int start, int exitNode,
               vector<int>& vis, vector<int>& jdist)
{
    int n = g.size();
    queue<int> q;
    int stamp = start;              // unique “visited mark”
    jdist[start] = 0;
    vis[start] = stamp;
    q.push(start);

    while (!q.empty()) {
        int u = q.front(); q.pop();
        if (u == exitNode) return true;
        for (int v : g[u]) {
            if (vis[v] == stamp) continue;
            int jd = jdist[u] + 1;
            if (tomDist[v] != -1 && jd >= tomDist[v]) continue;
            vis[v] = stamp;
            jdist[v] = jd;
            q.push(v);
        }
    }
    return false;
}

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

    int n, m, t, p, e;
    cin >> n >> m >> t >> p >> e;

    vector<vector<int>> graphJ(n + 1);
    vector<vector<int>> graphT(n + 1);

    for (int i = 0; i < m; i++) {
        int a, b, s;
        cin >> a >> b >> s;
        graphJ[a].push_back(b);
        graphJ[b].push_back(a);
        if (s == 2) {
            graphT[a].push_back(b);
            graphT[b].push_back(a);
        }
    }

    vector<int> tomDist = bfsTom(graphT, t);

    // reuse memory
    vector<int> vis(n + 1, 0);
    vector<int> jdist(n + 1, 0);

    while (p--) {
        int start;
        cin >> start;
        bool res = canEscape(graphJ, tomDist, start, e, vis, jdist);
        cout << (res ? "IGEN\n" : "NEM\n");
    }

    return 0;
}