#include <iostream>
#include <vector>
#include <queue>

using namespace std;

vector<int> BFS(vector<vector<int>> &graph,int v)
{
vector<bool> visit(graph.size()+1,false);
vector<int> layer(graph.size()+1,-1);
queue<int> bfs;
layer[v]=0;
visit[v]=true;
bfs.push(v);
//int layercnt=0;
while(bfs.size()!=0)
    {
    //cout<<graph[v].size()<<endl;
    v=bfs.front();
    layercnt++;
    visit[v]=true;
    for(auto x : graph[v])
        {
        //cout<<v<<" "<<x<<" "<<layercnt<<endl;
        if(!visit[x])
            {
            bfs.push(x);
            layer[x]=layer[v]+1;
            visit[x]=true;
            }
        }
    bfs.pop();
    }



return layer;
}

void solve(vector<int> &tom,vector<int> &jerry,vector<vector<int>> &graph,int s,vector<bool> &visit,bool &p,int &e)
{

visit[s]=true;

if(tom[s]!=-1)
    {
    if(tom[s]<=jerry[s])
        {
        return ;
        }
    }
if(s==e)
    {
    p=true;
    return ;
    }
for(auto x : graph[s])
    {
    if(p)
        {
        return ;
        }
    if(!visit[x])
        solve(tom,jerry,graph,x,visit,p,e);
    }
}




int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie();
    int n,m,t,jt,e;
    cin>>n>>m>>t>>jt>>e;
    vector<vector<int>>graphj(n+1);
    vector<vector<int>>grapht(n+1);
    int x,y,d;
    for(int i=0;i<m;i++)
        {
        cin>>x>>y>>d;
        graphj[x].push_back(y);
        graphj[y].push_back(x);
        if(d==2)
            {
            //cout<<x<<" "<<y<<endl;
            grapht[x].push_back(y);
            grapht[y].push_back(x);
            }
        }

    vector<int> ans=BFS(grapht,t);
    while(jt--)
        {
        cin>>x;
        vector<int> jerry=BFS(graphj,x);
        vector<bool> visit(n+1,false);
        bool p=false;
        solve(ans,jerry,graphj,x,visit,p,e);
        if(p==false)
            {
            cout<<"NEM"<<endl;
            }
        else cout<<"IGEN"<<endl;
        }
    return 0;
}