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

int n, m, t, p, e;
vector<int> tL;
vector<vector<int>> szom, tszom;

int main() {
    cin >> n >> m >> t >> p >> e;
    tL.resize(n+1, -1);
    szom.resize(n+1, vector<int>(0));
    tszom.resize(n+1, vector<int>(0));

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

    queue<int> sor;
    sor.push(t);
    tL[t] = 0;
    int ln = 0;
    while(!sor.empty()) {
        for(auto i : tszom[sor.front()]) {
            if(tL[i] == -1) {
                tL[i] = tL[sor.front()]+1;
                sor.push(i);
                ln = max(ln, tL[i]);
            }
        }
        sor.pop();
    }

    vector<bool> win(n+1, false);
    vector<int> L(n+1, -1);
    win[e] = true;
    L[e] = true;
    sor.push(e);
    while(!sor.empty()) {
        for(auto i : szom[sor.front()]) {
            if(L[i] == -1 && tL[i] == -1) {
                win[i] = true;
                sor.push(i);
            }
            L[i] = 0;
        }
        sor.pop();
    }

    for(int i = 1; i <= n; i++) {
        L[i] = -1;
        if(tL[i] == ln && tL[i] > 0) {
            sor.push(i);
            L[i] = ln;
        }
    }

    while(!sor.empty()) {
        win[sor.front()] = true;
        if(L[sor.front()] > 1)
            for(auto i : szom[sor.front()]) {
                if(L[i] == -1) {
                    L[i] = L[sor.front()]-1;
                    sor.push(i);
                }
            }
        sor.pop();
    }

    for(int i = 0; i < p; i++) {
        int k;
        cin >> k;
        if(win[k]) cout << "IGEN\n";
        else cout << "NEM\n";
    }

    return 0;
}