#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000010;
typedef pair<ll,ll> pr;

ll head[N],e[N],ne[N],w[N],idx=0;
bool st[N];
ll node[N],tnode[N];ll n,m,hp;
ll dis[N];
void add(ll a,ll b,ll c){
	e[idx]=b,w[idx]=c,ne[idx]=head[a],head[a]=idx;idx++;
}
bool dijkstra(ll x){
	priority_queue<pr,vector<pr>,greater<pr> >q;
	memset(dis,0x3f,sizeof dis);
	dis[1]=0;
	q.push({0,1});
	while(q.size()){
		auto it=q.top();q.pop();
		ll dist=it.first,id=it.second;
		if(st[id]) continue;
		st[id]=true;
		for(ll i=head[id];i!=-1;i=ne[i]){
			ll j=e[i];
			if(tnode[j]>x) continue;
			if(dis[j]>dist+w[i]){
				dis[j]=dist+w[i];
				q.push({dis[j],j});
			}
		}
	}
	return dis[n]<hp;
}
int main(){
	memset(head,-1,sizeof head);
	scanf("%lld %lld %lld",&n,&m,&hp);
	for(ll i=0;i<n;i++) scanf("%lld",&node[i]);
	for(ll i=0;i<n;i++) tnode[i]=node[i];
	for(ll i=1;i<=m;i++) {
		ll a,b,c;	scanf("%lld %lld %lld",&a,&b,&c);
		add(a,b,c);add(b,a,c);
	}
	sort(node,node+n);
	if(!dijkstra(0x3f3f3f3f)){puts("AFK"); return 0;}
	ll l=0,r=n-1;
	while(l<r){
		ll mid=l+r>>1;
		if(dijkstra(node[mid])) r=mid;
		else l=mid+1;
	}
	cout<<node[l+r>>1]<<endl;

	
	
	return 0;
}