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

int main() {
	const int MAX_DIST = 1e6;

	int n, m, t, p, e;
	cin >> n >> m >> t >> p >> e;
	--t;
	--e;
	vector<vector<pair<int, int>>> adj(n);
	for (int i = 0; i < m; ++i) {
		int a, b, c;
		cin >> a >> b >> c;
		--a;
		--b;
		--c;
		adj[a].push_back({b, c});
		adj[b].push_back({a, c});
	}

	vector<int> tdist(n, MAX_DIST);

	queue<int> q;
	q.push(t);
	tdist[t] = 0;

	while (!q.empty()) {
		int node = q.front();
		q.pop();

		for (auto [next, w] : adj[node]) {
			if (w && tdist[next] == MAX_DIST) {
				tdist[next] = tdist[node] + 1;
				q.push(next);
			}
		}
	}

	vector<int> jtime(n, 0);
	jtime[e] = tdist[e];
	q.push(e);

	while (!q.empty()) {
		int node = q.front();
		q.pop();

		for (auto [next, w] : adj[node]) {
			int new_jtime = min(jtime[node] - 1, tdist[next]);
			if (new_jtime > jtime[next]) {
				jtime[next] = new_jtime;
				q.push(next);
			}
		}
	}

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