#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m, t, p, e;
    cin >> n >> m >> t >> p >> e;
    vector<vector<int> > g1(n + 1), g2(n + 1);
    for(int i = 0; i < m; i++)
    {
        int x, y, w;
        cin >> x >> y >> w;
        g1[x].push_back(y);
        g1[y].push_back(x);
        if(w == 2)
        {
            g2[x].push_back(y);
            g2[y].push_back(x);
        }
    }
    queue<int> q;
    q.push(t);
    vector<int> d(n + 1, 1e9);
    d[t] = 0;
    while(!q.empty())
    {
        int v = q.front();
        q.pop();
        for(auto x : g2[v])
        {
            if(d[x] == 1e9)
            {
                d[x] = d[v] + 1;
                q.push(x);
            }
        }
    }
    priority_queue<pair<int, int> > pq;
    vector<int> l(n + 1, -1);
    pq.push({d[e] - 1, e});
    l[e] = d[e] - 1;
    while(!pq.empty())
    {
        auto [l_v, v] = pq.top();
        pq.pop();
        //cout << v << "\n";
        if(l[v] != l_v) continue;

        for(auto x : g1[v])
        {
            int len = min(d[x] - 1, l[v] - 1);
            if(l[x] < len)
            {
                l[x] = len;
                pq.push({l[x], x});
            }
        }
    }
    while(p--)
    {
        int x;
        cin >> x;
        cout << (l[x] < 0 ? "NEM" : "IGEN") << "\n";
    }
}