#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (((bit >> i) & 1) > 0)
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

// 2のべき乗数かどうか
bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};  // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};    // 右，下，左，上
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;


class Edge {
public:
    int no = 0;
    int from = 0;
    int to = 0;
    long long weight = 0;

    Edge(int no, int from, int to, long long weight) : no(no), from(from), to(to), weight(weight) {
    }

};

class Graph {
public:
    const int N;
    std::vector<std::vector<Edge>> graph;
    Graph(int N) : N(N) {
        this->graph.resize(N);
    }

    void add_undirected_edge(int no, const int u, const int v, const long long w) {
        this->graph.at(u).emplace_back(Edge(no, u, v, w));
        this->graph.at(v).emplace_back(Edge(no, v, u, w));
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL N, M, X;
    cin >> N >> M >> X;

    auto T = make_v<LL>(N);
    FOR(i, 0, N) {
        cin >> T[i];
    }

    Graph graph(N);
    FOR(i, 0, M) {
        LL A, B, D;
        cin >> A >> B >> D;
        A--; B--;
        graph.add_undirected_edge(i, A, B, D);
    }

    auto used = make_v<bool>(N, X + 10, 3);

    // time, wait, from, node
    priority_queue<tuple<LL, LL, int, int>, vector<tuple<LL, LL, int, int>>, greater<tuple<LL, LL, int, int>>> que;
    que.emplace(make_tuple(0, X, T[0], 0));

    while (not que.empty()) {
        LL time, wait, from, u;
        tie(time, wait, from, u) = que.top(); que.pop();

        if (used[u][wait][from]) {
            continue;
        }
        used[u][wait][from] = true;

        if (u == N - 1) {
            print(time);
            return 0;
        }

        FOE(e, graph.graph[u]) {
            int v = e.to;

            // 無条件でいける
            if (T[u] == T[v] or T[v] == 1) {
                if (T[v] == 1) {
                    LL new_wait = max(0ll, wait - e.weight);
                    if (not used[v][new_wait][from]) {
                        que.emplace(make_tuple(time + e.weight, new_wait, from, v));
                    }
                }
                else {
                    if (not used[v][X][T[v]]) {
                        que.emplace(make_tuple(time + e.weight, X, T[v], v));
                    }
                }
            }

            // 条件付きでいける
            else if (T[u] == 1) {
                if (wait <= e.weight) {
                    if (not used[v][X][T[v]]) {
                        que.emplace(make_tuple(time + e.weight, X, T[v], v));
                    }
                }
                else {
                    if (T[v] == from) {
                        if (not used[v][X][T[v]]) {
                            que.emplace(make_tuple(time + e.weight, X, T[v], v));
                        }
                    }
                }
            }
            else {
                if (e.weight >= X) {
                    if (not used[v][X][T[v]]) {
                        que.emplace(make_tuple(time + e.weight, X, T[v], v));
                    }
                }
            }

        }
    }

    return 0;
}




Measured memory_bytes: 152776