#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

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

    int N, M, T, P, E;
    cin >> N >> M >> T >> P >> E;
    vector<vector<pair<int, int>>> neighbourS(N); // node, weihgt
    while (M--) {
        int A, B, S;
        cin >> A >> B >> S;
        --A;
        --B;
        neighbourS[A].push_back({ B, S });
        neighbourS[B].push_back({ A, S });
    }
    --T;
    --E;
    // szélességi bejárás Tomra
    vector<int> t_distS(N, -1); // push in pqS, if has -2 distance neihbour
    queue<int> currentS;
    t_distS[T] = 0;
    currentS.push(T);
    while (!currentS.empty()) {
        int c = currentS.front();
        currentS.pop();
        for (auto e : neighbourS[c]) {
            if (e.second == 2 && t_distS[e.first] == -1) {
                t_distS[e.first] = t_distS[c] + 1;
                currentS.push(e.first);
            }
        }
    }
    vector<int> e_distS(N, -1);
    if (t_distS[E] == -1) {
        e_distS[E] = 100000;
    }
    priority_queue<pair<int, int>> pqS; // distance, node
    pqS.push({ e_distS[E], E });
    while (!pqS.empty()) {
        pair<int, int> c = pqS.top();
        pqS.pop();
        for (auto e : neighbourS[c.second]) {
            if (e_distS[e.first] == -1) {
                int d = c.first ? c.first - 1 : 0;
                e_distS[e.first] = t_distS[e.first] == -1 ? d : min(d, t_distS[e.first]);
                pqS.push({ e_distS[e.first], e.first });
            }
        }
    }
    while (P--) {
        int K;
        cin >> K;
        --K;
        cout << (e_distS[K] ? "IGEN\n" : "NEM\n");
    }
}