#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int INF=500000;
int main()
{
    int n,m,tom,proba,egerlyuk;
    cin>>n>>m>>tom>>proba>>egerlyuk;
    vector<vector<int>> tomg(n+1);
    vector<vector<int>> jerryg(n+1);
    int from,to,type;
    for(int i=0;i<m;i++)
        {
        cin>>from>>to>>type;
        //cout<<from<<" "<<to<<" "<<type<<"\n";
        if(type==1)
            {
            jerryg[from].push_back(to);
            jerryg[to].push_back(from);
            }
        else
            {
            jerryg[from].push_back(to);
            jerryg[to].push_back(from);
            tomg[from].push_back(to);
            tomg[to].push_back(from);
            }
        }

    vector<int> tomd(n+1,INF);
    vector<bool> visit(n+1,false);
    queue<int> q;
    q.push(tom);visit[tom]=true;tomd[tom]=0;
    while(q.size())
        {
        int v=q.front();q.pop();
        for(int x:tomg[v])
            {
            if(!visit[x])
                {
                visit[x]=true;
                q.push(x);
                tomd[x]=tomd[v]+1;
                }
            }
        }
    vector<int> ans(n+1,INF);
    for(int i=0;i<=n;i++)visit[i]=false;
    q.push(egerlyuk);visit[egerlyuk]=true;ans[egerlyuk]=INF;
    while(q.size())
        {
        //cout<<"ALMAAAAAAAAAAA\n";
        int v=q.front();q.pop();
        for(int x:jerryg[v])
            {
            if(!visit[x])
                {
                visit[x]=true;
                q.push(x);
                //cout<<x<<endl;
                ans[x]=min(min(ans[x],ans[v]-1),tomd[x]);
                }
            }
        }
    int tmp;
    for(int i=0;i<proba;i++)
        {
        cin>>tmp;
        if(ans[tmp]<=0)
            {
            cout<<"NEM\n";
            }
        else
            {
            cout<<"IGEN\n";
            }
        }
    return 0;
}