求助一下！！！

WA了第八个点……

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <algorithm>

using namespace std;

#define MAXN 10100
#define MAXM 50100
#define INF 2e9

struct Edge
{
    int v, w, nxt;
} edge[MAXM << 1];
queue<int> que;
int n, m, b, u, v, w, cnt, ans;
int head[MAXN], f[MAXN], dis[MAXN], k[MAXN];
bool vis[MAXN];

void add_edge(int u, int v, int w)
{
    edge[++cnt] = Edge{ v, w, head[u] };
    head[u] = cnt;
}

bool check(int x)
{
    //printf("%d %d %d\n", x, f[1], f[n]);
    if (x < k[1] || x < k[n])
        return 0;
    memset(dis, INF, sizeof(dis));
    for (int i = 1; i <= n; ++i)
        vis[i] = (x < k[i]);
    dis[1] = 0;
    que.push(1);
    while (!que.empty())
    {
        int x = que.front();
        que.pop();
        if (vis[x])
            continue;
        vis[x] = 1;
        for (int i = head[x]; i; i = edge[i].nxt)
        {
            int v = edge[i].v;
            int w = edge[i].w;
            if (dis[v] > dis[x] + w)
            {
                dis[v] = dis[x] + w;
                if (!vis[v])
                    que.push(v);
            }
        }
    }
    if (dis[n] <= b)
        return 1;
    return 0;
}

int main()
{
    scanf("%d%d%d", &n, &m, &b);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &k[i]), f[i] = k[i];
    for (int i = 1; i <= m; ++i)
    {
        scanf("%d%d%d", &u, &v, &w);
        if (u == v)
            continue;
        add_edge(u, v, w);
        add_edge(v, u, w);
    }
    sort(f + 1, f + 1 + n);
    if (!check(f[n]))
        printf("AFK"), exit(0);
    int l = 1, r = n;
    ans = f[n];
    while (l <= r)
    {
        int mid = (l + r) >> 1;
        if (check(f[mid]))
            ans = f[mid], r = mid - 1;
        else
            l = mid + 1;
    }
    printf("%d", ans);
    return 0;
}