#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

const ll INF = 1e+15;

vector<vector<ll>> warshallfloyd(vector<vector<ll>> g){
    int n = g.size();
    vector<vector<ll>> dist(n, vector<ll>(n));
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            dist[i][j] = g[i][j];
        }
        dist[i][i] = 0;
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            for(int k = 0; k < n; k++){
                ll new_len = dist[j][i] + dist[i][k];
                dist[j][k] = min(new_len, dist[j][k]);
            }
        }
    }
    return dist;
}

int popcount(int n){
    int ans = 0;
    for(int i = 0; i < 20; i++){
        if(n&(1<<i)) ans++;
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m, k; cin >> n >> m >> k;
    vector<ll> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    vector<vector<ll>> g(n, vector<ll>(n, INF));
    for(int i = 0; i < m; i++){
        int x, y; ll z;
        cin >> x >> y >> z; x--; y--;
        g[x][y] = z;
        g[y][x] = z;
    }
    auto d = warshallfloyd(g);
    vector<ll> dp(1<<n, INF);
    dp[0] = 0;
    for(int i = 0; i < n; i++){
        dp[1<<i] = a[i];
    }
    for(int s = 1; s < (1<<n); s++){
        for(int i = 0; i < n; i++){
            if(s&(1<<i)) continue;
            ll min_d = INF;
            for(int j = 0; j < n; j++){
                if((s&(1<<j)) == 0) continue;
                chmin(min_d, d[i][j]);
            }
            chmin(dp[s+(1<<i)], dp[s]+min_d+a[i]);
        }
    }
    ll ans = INF;
    for(int s = 0; s < (1<<n); s++){
        if(popcount(s) == k) chmin(ans, dp[s]);
    }
    cout << ans << endl;
}