1 #include<iostream>
 2 #include<algorithm>
 3 #include<cstring>
 4 #include<vector>
 5 #include<queue>
 6 using namespace std;
 7 typedef long long LL;
 8 const LL INF = 900000000;
 9 const int maxn = 1e4+10;
10 struct node{
11     LL to,cost;
12 };
13 vector<node>e[maxn];
14 LL dis[maxn],f[maxn],a[maxn],k[maxn];
15 bool vis[maxn];
16 LL n,m,b;
17 bool SPFA(LL key)
18 {
19     if(a[1]>key)return false;
20     for(int i=0;i<maxn;i++){
21         vis[i] = false;
22         dis[i] = INF;
23         f[i] = 0;
24     }
25     vis[1] = true;
26     dis[1] = 0;
27     queue<LL>Q;
28     Q.push(1);
29     while(!Q.empty()){
30         LL t = Q.front();Q.pop();
31         vis[t] = false;
32         for(int i=0;i<e[t].size();i++){
33             LL tmp = e[t][i].to;
34             if(dis[tmp]>dis[t]+e[t][i].cost){
35                 dis[tmp] = dis[t] +e[t][i].cost;
36                 if(!vis[tmp]&&k[tmp]<=key){
37                     vis[tmp] = true;
38                     Q.push(tmp);
39                     if(++f[tmp]>n)return false;
40                 }
41             }
42         }
43     }
44     if(dis[n]<b)return true;
45     else return false;
46 }
47 int main()
48 {
49     ios::sync_with_stdio(false);
50     while(cin>>n>>m>>b){
51         LL l = 0,r = 0;
52         for(int i=1;i<=n;i++){
53             cin>>k[i];
54             r = max(r,k[i]);// 缴费肯定不会大于收费最大值
55         }
56         l = max(k[1],k[n]);//缴费肯定不会小与起点或终点
57         LL x,y,z;
58         for(int i=0;i<m;i++){
59             cin>>x>>y>>z;
60             if(x==y)continue;
61             node q;
62             q.to = y;
63             q.cost = z;
64             e[x].push_back(q);
65             q.to = x;
66             e[y].push_back(q);
67         }
68         if(!SPFA(INF)){//如果在没有过路费限制的情况下都不能到达终点，则直接输出不能到达
69             cout<<"AFK"<<endl;
70             continue;
71         }//剩下的则是必定可以到达终点则必定存在一个花费的最小值
72         while(l<=r){
73             LL mid = (l+r)>>1;
74             if(SPFA(mid))r = mid-1;
75             else l = mid+1;
76         }
77         cout<<l<<endl;
78     }
79     return 0;
80 }