#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace atcoder;
//#pragma GCC optimize ("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

using mint = modint998244353;
using vm = vector<mint>;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N>>M>>K;
    vec a(N);
    rep(i, N) cin>>a[i];
    mat dist(N, vec(N, INF));
    {
        rep(i, 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]);
            }
        }
    }
    ll res = INF;
    vec dp(1<<N, INF);
    dp[0] = 0;
    rep(i, N) dp[1<<i] = a[i];
    reps(s, 1, 1<<N){
        if(__builtin_popcount(s) == K) chmin(res, dp[s]);
        rep(i, N){
            if(!((s>>i)&1)){
                ll d = INF;
                rep(j, N) if((s>>j)&1) chmin(d, dist[i][j]);
                chmin(dp[s | (1<<i)], dp[s] + d + a[i]);
            }
        }
    }
    cout<<res<<endl;
}