#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> g[100001];
int tomtav[100001];

int t,n,e;
void bfstom(int x){
	bool seen[100001];

	tomtav[x]=0; 
	seen[x]=true; 
	queue<int> q;
	q.push(x);
	while (!q.empty()){
		int v=q.front();
		q.pop();
		
		for (pair<int, int> edge:g[v]){
			if (edge.second==2 && !seen[edge.first]){
				tomtav[edge.first]=tomtav[v]+1;
				q.push(edge.first);
				seen[edge.first]=true;  
			}
		}
	}
}
int bfsj(int x, int e){
	vector<bool> seen(100001); 
	vector<int> jerrytav(100001); 
	jerrytav[x]=0;
	queue<int> q; 
	q.push(x); 
	seen[x]=true; 
	while (!q.empty()){
		int v=q.front();
		q.pop();
		
		for (pair<int, int> edge: g[v]){
			if (!seen[edge.first]){
				if ( tomtav[edge.first]==0 || tomtav[edge.first]>jerrytav[v]+1){
					jerrytav[edge.first]=jerrytav[v]+1;
					q.push(edge.first);
					seen[edge.first]=true; 
			}
				
			}
		} 
	}
	return jerrytav[e]; 
}
int main() {
	ios::sync_with_stdio(false);
  	cin.tie(0);
	int n, m,t,jt,e;
	cin>>n>>m>>t>>jt>>e;
	for (int i=0; i<m;i++){
		int x,y,z;
		cin>>x>>y>>z;
		g[x].push_back(make_pair(y,z));	
		g[y].push_back(make_pair(x,z));
	}
	bfstom(t);
	tomtav[t]=-1; 
	
	for (int i=0; i<jt;i++){
		int z; 
		cin>>z;

		int ans=bfsj(z,e);
		if (z==e) cout<<"IGEN"<<endl;
		else{
			for (int i=1; i<=n;i++){
			}
			if (ans==0) cout<<"NEM"<<endl;
			else cout<<"IGEN"<<endl; 
		}
	}
}