#include <bits/stdc++.h>
using namespace std;
int main() {
    int n,m,t,p,e; cin >> n >> m >> t >> p >> e;
    vector<vector<pair<int,int>>> g(n+1);
    for (int i = 0; i < m; i++) {
        int a,b,c; cin >> a >> b >> c;
        g[a].push_back({b,c});
        g[b].push_back({a,c});
    }
    vector<int> p1(p);
    for (int &x : p1) cin >> x;
    vector<int> d1(n+1,1e6);
    queue<int> q1;
    d1[t] = 0;
    q1.push(t);
    while (!q1.empty()) {
        int u = q1.front();
        q1.pop();
        for (auto x : g[u]) {
            if (x.second == 2 && d1[x.first] == 1e6) {
                d1[x.first] = d1[u]+1;
                q1.push(x.first);
            }
        }
    }
    priority_queue<pair<int,int>> q2;
    q2.push({d1[e],e});
    vector<bool> d2(n+1);
    while (!q2.empty()) {
        int u = q2.top().second, d = q2.top().first;
        q2.pop();
        if (d <= 0) continue;
        d2[u] = true;
        for (auto x : g[u]) {
            if (!d2[x.first]) q2.push({min(d-1,d1[x.first]),x.first});
        }
    }
    for (int x : p1) {
        if (d2[x]) cout << "IGEN\n";
        else cout << "NEM\n";
    }
}