#include<bits/stdc++.h>
#include<random>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=2000010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

//Warshall_Floyd
vector<vector<ll> >d(18,vector<ll>(18,inf));
vector<ll>a(18);
void Warshall_Floyd(ll n){
    rep(k,n){
        rep(i,n){
            rep(j,n)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
        }
    }
}
ll n,m,k;
vector<vector<ll> >dp(1<<18,vector<ll>(18,inf));
vector<vector<ll> >mi(1<<18,vector<ll>(18,inf));
ll dfs(ll i,ll j,ll cnt){
    if(dp[i][j]<inf)return dp[i][j];
    if(cnt==k){
        dp[i][j]=a[j];
        return a[j];
    }
    ll res=inf;
    rep(l,n){
        if((1<<l)&i)continue;
        res=min(res,mi[i][l]+dfs(i+(1<<l),l,cnt+1));
    }
    dp[i][j]=res+a[j];
    return dp[i][j];
}
void solve(){
    cin>>n>>m>>k;
    rep(i,n)cin>>a[i];
    rep(i,m){
        ll x,y,z;cin>>x>>y>>z;
        x--;y--;
        d[x][y]=z;
        d[y][x]=z;
    }
    Warshall_Floyd(n);
    rep(i,1<<n){
        ll cnt=0;
        rep(j,n){
            if((1<<j)&i)cnt++;
        }
        rep(j,n){
            if((1<<j)&i)continue;
            if(cnt>0){
                rep(k,n){
                    if((1<<k)&i)mi[i][j]=min(mi[i][j],d[k][j]);
                }
            }
        }
    }
    ll ans=inf;
    rep(j,n){
        ans=min(ans,dfs(1<<j,j,1));
    }
    cout<<ans<<endl;
}

signed main(){
    solve();
}