#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;
    while(!sor.empty()) {
        for(auto i : tszom[sor.front()]) {
            if(tL[i] == -1) {
                tL[i] = tL[sor.front()]+1;
                sor.push(i);
            }
        }
        sor.pop();
    }

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

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

		queue<int> bsor;
		vector<int> L(n+1, -1);
		bsor.push(k);
		L[k] = 0;
		string jo = "NEM";

		while(!bsor.empty()) {
			if(win[bsor.front()]) {
				jo = "IGEN";
				break;
			}
			for(auto i : szom[bsor.front()]) {
				if(L[i] == -1 && (tL[i] == -1 || tL[i] > L[bsor.front()]+1)) {
					L[i] = L[bsor.front()]+1;
					bsor.push(i);
				}
			}
        	bsor.pop();
    	}

		cout << jo << '\n';
	}

    return 0;
}