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

int main() {
  cin.tie(0), ios::sync_with_stdio(0);
  int n, m, tom_start, attempts, goal;
  cin >> n >> m >> tom_start >> attempts >> goal;
  vector<vector<int>> graph(n + 1), tom_graph(n + 1);
  while (m--) {
    int u, v, s;
    cin >> u >> v >> s;
    graph[u].push_back(v);
    graph[v].push_back(u);
    if (s == 2) {
      tom_graph[u].push_back(v);
      tom_graph[v].push_back(u);
    }
  }

  vector<int> dist_from_tom(n + 1, -1);
  queue<int> tq;
  tq.push(tom_start);
  dist_from_tom[tom_start] = 0;
  while (!tq.empty()) {
    int u = tq.front();
    tq.pop();
    for (auto v : tom_graph[u]) {
      if (dist_from_tom[v] != -1)
        continue;
      dist_from_tom[v] = dist_from_tom[u] + 1;
      tq.push(v);
    }
  }

  auto do_attempt = [&](int jerry_start) {
    vector<int> dist(n + 1, -1);
    queue<int> jq;
    jq.push(jerry_start);
    dist[jerry_start] = 0;
    while (!jq.empty()) {
      int u = jq.front();
      jq.pop();
      for (auto v : graph[u]) {
        if (dist[v] != -1)
          continue;
        dist[v] = dist[u] + 1;
        if (dist_from_tom[v] != -1 && dist[v] >= dist_from_tom[v])
          continue;
        jq.push(v);
      }
    }
    return dist[goal] != -1;
  };
  while (attempts--) {
    int jerry_start;
    cin >> jerry_start;
    cout << (do_attempt(jerry_start) ? "IGEN" : "NEM") << endl;
  }
}