#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
//#define mod 998244353
#define FS fixed<<setprecision(15)
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
template<class T> using V=vector<T>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline void out(T a){ cout << a << '\n'; }
void YN(bool ok){if(ok) cout << "Yes" << endl; else cout << "No" << endl;}
//void YN(bool ok){if(ok) cout << "YES" << endl; else cout << "NO" << endl;}


const ll INF=1e18;
const int mx=200005;
ll dist[22][22];
ll dp[(1<<18)+3];
struct edge{
    ll to,cost;
};

int main(){
    //オーバーフローは大丈夫ですか？？
    cin.tie(0);ios::sync_with_stdio(false);
    int n,m,k;
    cin>>n>>m>>k;
    V<ll> a(n);
    cinf(n,a);
    V<V<edge>> G(n);
    rep(i,m){
        ll a,b,c;
        cin>>a>>b>>c;
        a--;b--;
        G[a].pb({b,c});
        G[b].pb({a,c});
    }
    rep(i,n){
        rep(j,n) dist[i][j]=INF;
    }
    priority_queue<P,V<P>,greater<P>> que;
    rep(i,n){
        dist[i][i]=0;
        que.push({0,i});
        while(que.size()){
            P p=que.top();
            que.pop();
            int v=p.sc;
            if(dist[i][v]<p.ft) continue;
            for(edge e:G[v]){
                int nv=e.to;
                if(chmin(dist[i][nv],dist[i][v]+e.cost)){
                    que.push({dist[i][nv],nv});
                }
            }
        }
    }
    rep(i,(1<<n)) dp[i]=INF;
    dp[0]=0;
    rep(i,(1<<n)){
        rep(j,n){
            if(i>>j&1) continue;
            ll cst=a[j];
            if(i!=0){
                ll tmp=INF;
                rep(k,n){
                    if(i>>k&1) chmin(tmp,dist[j][k]);
                }
                cst+=tmp;
            }
            chmin(dp[i|(1<<j)],dp[i]+cst);
        }
    }
    ll ans=INF;
    rep(i,(1<<n)){
        if(__builtin_popcount(i)==k) chmin(ans,dp[i]);
    }
    out(ans);
}