#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int n, m, t, p, e, a, b, s;
vector <vector <int>> g(2e5);
vector <vector <int>> g2(2e5);
vector <int> dt(2e5, 1e9);
vector <int> v(2e5, 0);
vector <bool> done(2e5, false);
queue <int> q;
priority_queue <pair <int, int>> pq;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> m >> t >> p >> e;
	for (int i = 0; i < m; i++) {
		cin >> a >> b >> s;
		g[a].push_back(b);
		g[b].push_back(a);
		if (s == 1) continue;
		g2[a].push_back(b);
		g2[b].push_back(a);
	}

	dt[t] = 0;
	q.push(t);
	while (q.size()) {
		a = q.front();
		q.pop();
		for (int i : g2[a]) {
			if (dt[i] < n) continue;
			dt[i] = dt[a] + 1;
			q.push(i);
		}
	}

	v[e] = dt[e];
	pq.push({ v[e], e });
	while (pq.size()) {
		a = pq.top().second;
		pq.pop();
		if (done[a]) continue;
		done[a] = true;
		for (int i : g[a]) {
			s = min(v[a] - 1, dt[i]);
			if (s > v[i]) pq.push({ v[i] = s, i });
		}
	}

	while (p--) {
		cin >> a;
		cout << (v[a] ? "IGEN\n" : "NEM\n");
	}
}