#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

int n, m, k;
vector<int> a;
vector<vector<ll>> dist;
vector<ll> dp;

ll f(int mask){
    if(dp[mask] != -1) return dp[mask];
    dp[mask] = 1LL << 60;
    for(int last = 0; last < n; last++){
        if(!((mask >> last) & 1)) continue;
        ll cost = a[last];
        int pmask = mask ^ (1 << last);
        cost += f(pmask);
        ll distmin = 1LL << 60;
        for(int j = 0; j < n; j++){
            if(!((pmask >> j) & 1)) continue;
            distmin = min(distmin, dist[last][j]);
        }
        cost += distmin;
        dp[mask] = min(dp[mask], cost);
    }
    return dp[mask];
}

int main(){
    cin >> n >> m >> k;
    a = vector<int>(n);
    for(auto &it: a) cin >> it;
    dist = vector<vector<ll>>(n, vector<ll>(n, 1LL << 60));
    for(int i = 0; i < n; i++) dist[i][i] = 0;
    for(int i = 0; i < m; i++){
        int x, y, z; cin >> x >> y >> z;
        x--; y--;
        dist[x][y] = z;
        dist[y][x] = z;
    }

    for(int l = 0; l < n; l++){
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                dist[i][j] = min(dist[i][j], dist[i][l]+dist[l][j]);
            }
        }
    }

    dp = vector<ll>(1 << n, -1);
    for(int i = 0; i < n; i++) dp[1 << i] = a[i];

    ll ans = 1LL << 60;
    for(int bit = 0; bit < (1 << n); bit++){
        int cnt = 0;
        for(int i = 0; i < n; i++){
            if((bit >> i) & 1) cnt++;
        }
        if(cnt == k) ans = min(ans, f(bit));
    }
    cout << ans << endl;
    return 0;
}