#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<queue>

using namespace std;

#define maxn 10005

#define maxm 50005

#define inf 2000000000

int n,m,b,cnt,ans;

int c[maxn],dis[maxn];

int head[maxm];

bool vis[maxn];

struct edge{

    int next,to,w;

}e[maxm<<];

void insert(int u,int v,int k){

    cnt++;

    e[cnt].next=head[u];e[cnt].to=v;e[cnt].w=k;

    head[u]=cnt;

}

bool spfa(int x){

    queue<int> q;

    memset(vis,,sizeof vis);

    memset(dis,0x3f,sizeof dis);

    vis[]=;dis[]=;

    q.push();

    while(!q.empty()){

        int now=q.front();

        q.pop();vis[now]=;

        for(int i=head[now];i;i=e[i].next){

            int k=e[i].to;

            if(c[k]>x)continue;

            if(dis[k]>dis[now]+e[i].w){

                dis[k]=dis[now]+e[i].w;

                if(!vis[k]){

                    vis[k]=;

                    q.push(k);

                }

            }

        }

    }

    if(b-dis[n]<=||dis[n]==inf)return ;

    return ;

}

int main(){

    int l=,r=;

    scanf("%d%d%d",&n,&m,&b);

    for(int i=;i<=n;i++){

        scanf("%d",&c[i]);

        r=max(r,c[i]);

    }

    int u,v,k;

    for(int i=;i<=m;i++){

        scanf("%d%d%d",&u,&v,&k);

        insert(u,v,k);

        insert(v,u,k);

    }

    if(spfa(inf)){

        int mid=(l+r)>>;

        while(l<=r){

            if(spfa(mid)){

                r=mid-;

                ans=mid;

            }

            else l=mid+;

        mid=(l+r)>>;

        }

    printf("%d\n",ans);

    }

    else printf("AFK\n");

    return ;

}