#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string.h>
using namespace std;
#define all(x) (x).begin(), (x).end()

template< typename T >
struct edge {
    int src, to;
    T cost;
    
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
    
    edge &operator=(const int &x) {
        to = x;
        return *this;
    }
    
    operator int() const { return to; }
};

template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;

template< typename T >
vector< T > dijkstra(WeightedGraph< T > &g, int s)
{
    const auto INF = numeric_limits< T >::max();
    vector< T > dist(g.size(), INF);
    
    using Pi = pair< T, int >;
    priority_queue< Pi, vector< Pi >, greater< Pi > > que;
    dist[s] = 0;
    que.emplace(dist[s], s);
    while(!que.empty()) {
        T cost;
        int idx;
        tie(cost, idx) = que.top();
        que.pop();
        if(dist[idx] < cost) continue;
        for(auto &e : g[idx]) {
            auto next_cost = cost + e.cost;
            if(dist[e.to] <= next_cost) continue;
            dist[e.to] = next_cost;
            que.emplace(dist[e.to], e.to);
        }
    }
    return dist;
}

int main(){
    int N, M, L;
    cin >> N >> M >> L;
    int sum = 0;
    int t[N];
    for(int i = 0; i < N; i++){
        cin >> t[i];
        sum += t[i];
    }
    WeightedGraph<long> graph(N);
    for(int i = 0; i < M; i++){
        int a, b, c;
        cin >> a >> b >> c;
        graph[a - 1].push_back(edge<long>(b - 1, c));
        graph[b - 1].push_back(edge<long>(a - 1, c));
    }
    vector<long> dist[N];
    for(int i = 0; i < N; i++){
        dist[i] = dijkstra(graph, i);
    }
    long ans = 1e18;
    for(int i = 0; i < N; i++){
        if(sum == t[i]){
            cout << 0 << endl;
            return 0;
        }
        long cost = 0;
        for(int j = 0; j < N; j++){
            cost += dist[i][j] * t[j] * 2;
        }
        long this_ans = 1e18;
        for(int j = 0; j < N; j++){
            if(!t[j]){
                continue;
            }
            this_ans = min(this_ans, dist[L - 1][j] - dist[i][j]);
        }
        ans = min(ans, cost + this_ans);
    }
    cout << ans << endl;
}