#include<cstdio>

#include<cctype>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

struct Edge{

    int next,to,dis;

}edge[];

int head[],num;

int dis[];

inline void add(int from,int to,int dis){

    edge[++num]=(Edge){head[from],to,dis};

    head[from]=num;

}

int que[];

int cost[];

int f[],h,t=;

bool vis[];

long long ans=-;

int main(){

    int n=read(),m=read(),Max=read();

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

        que[i]=read();

        cost[i]=que[i];

    }

    sort(que+,que+n+);

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

        int from=read(),to=read(),dst=read();

        add(from,to,dst);

        add(to,from,dst);

    }

    int l=,r=n;

    while(l<=r){

        int mid=(l+r)>>;

        for(int i=;i<=n;++i)    dis[i]=;

        memset(vis,,sizeof(vis));

        int limit=que[mid];

        f[]=;h=;t=;dis[]=;

        while(h++<t){

            vis[f[h]]=;

            for(int i=head[f[h]];i;i=edge[i].next){

                if(cost[edge[i].to]>limit)    continue;

                if(dis[f[h]]+edge[i].dis<dis[edge[i].to]){

                    dis[edge[i].to]=dis[f[h]]+edge[i].dis;

                    if(!vis[edge[i].to]){

                        vis[edge[i].to]=;

                        f[++t]=edge[i].to;

                    }

                }

            }

        }

        if(dis[n]>=Max||cost[]>limit)    l=mid+;

        else{

            ans=que[mid];

            r=mid-;

        }

    }

    if(ans==-)    printf("AFK");

    else        printf("%lld",ans);

    return ;

}