#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>

using namespace std;
using ll = long long;

int main(){

    ll N, M, K, a, b, c, mx, mi;
    cin >> N >> M >> K;
    vector<ll> A(N);
    for (int i=0; i<N; i++) cin >> A[i];
    vector<vector<ll>> dist(N, vector<ll>(N, 1e18));

    for (int i=0; i<N; i++) dist[i][i] = 0;

    for (int i=0; i<M; i++){
        cin >> a >> b >> c;
        a--; b--;
        dist[a][b] = min(c, dist[a][b]);
        dist[b][a] = min(c, dist[b][a]);
    }

    for (int k=0; k<N; k++){
        for (int i=0; i<N; i++){
            for (int j=0; j<N; j++){
                dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j]);
            }
        }
    }
    mx = 1<<N;

    vector<ll> dp(mx, 1e18);
    for (int i=0; i<mx; i++){
        for (int j=0; j<N; j++){
            if (i & 1<<j) continue;
            if (i == 0) dp[1<<j] = A[j];
            else{
                mi = 1e18;
                for (int k=0; k<N; k++){
                    if (!(i & 1<<k)) continue;
                    mi = min(mi, dist[j][k]);
                }
                dp[i|(1<<j)] = min(dp[i|(1<<j)], dp[i]+mi+A[j]);
            }
        }
    }

    mi = 1e18;
    for (int i=0; i<mx; i++){
        if (__builtin_popcount(i) == K) mi = min(mi, dp[i]);
    }

    cout << mi << endl;

    return 0;
}