#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

ll dist[18][18];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    VL a(n);
    rep(i, n) cin >> a[i];
    constexpr ll INF = 1e18;
    rep(i, 18) rep(j, 18) dist[i][j] = INF;
    rep(_, m) {
        int x, y, z;
        cin >> x >> y >> z;
        x--, y--;
        dist[x][y] = dist[y][x] = z;
    }
    rep(k, n) rep(i, n) rep(j, n) chmin(dist[i][j], dist[i][k] + dist[k][j]);
    VL dp(1 << n, INF);
    rep(i, n) dp[1 << i] = a[i];
    ll ans = INF;
    for(int s = 1; s < (1 << n); s++) {
        if (__builtin_popcount(s) == k) chmin(ans, dp[s]);
        rep(i, n) if ((s >> i & 1) == 0) {
            ll d = INF;
            rep(j, n) if (s >> j & 1) chmin(d, dist[i][j]);
            chmin(dp[s | 1 << i], dp[s] + a[i] + d);
        }
    }
    cout << ans << endl;
}