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

#define pb push_back

vector<int> tgraf[100009];
vector<int> jgraf[100009];
vector<int> ttav;
vector<int> jtav;
vector<int> tvolt;
vector<int> jvolt;

void solve(){
    int n, m, t, p, e;
    cin>>n>>m>>t>>p>>e;
    ttav.assign(n+1, INT_MAX);
    jtav.assign(n+1, INT_MAX);
    tvolt.assign(n+1, 0);
    jvolt.assign(n+1, 0);
    for(int i=0; i<m; i++){
        int a, b, c;
        cin>>a>>b>>c;
        if(c==2){
            tgraf[a].pb(b);
            tgraf[b].pb(a);
        }
        jgraf[a].pb(b);
        jgraf[b].pb(a);
    }
    ttav[t]=0;
    tvolt[t]=1;
    queue<int> q;
    q.push(t);
    while(!q.empty()){
        int elso=q.front();
        q.pop();
        for(int szom : tgraf[elso]){
            if(!tvolt[szom]){
                ttav[szom]=ttav[elso]+1;
                tvolt[szom]=1;
                q.push(szom);
            }
        }
    }
    jtav[e]=0;
    jvolt[e]=1;
    priority_queue<pair<int, int>> pq;
    pq.push({ttav[e], e});
    while(!pq.empty()){
        pair<int, int> elso=pq.top();
        pq.pop();
        if(elso.first>=0){
        jvolt[elso.second]=true;
        for(int szom : jgraf[elso.second]){
            if(!jvolt[szom]){
                pq.push({min(ttav[szom]-1, elso.first-1),szom});
            }
        }
        }
    }
    for(int i=0; i<p; i++){
        int a;
        cin>>a;
        if(jvolt[a]) cout<<"IGEN\n";
        else cout<<"NEM\n";
    }
    return;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    solve();
    return 0;
}