#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

ll dp[1<<18];

int main(){
   int n,m,k;
   cin>>n>>m>>k;
   vector<ll> a(n);
   rep(i,0,n)cin>>a[i];
   ll d[20][20];
   rep(i,0,n)rep(j,0,n)d[i][j]=INF;
   rep(i,0,n)d[i][i]=0;
   rep(_,0,m){
      int u,v,w;
      cin>>u>>v>>w;
      u--; v--;
      d[u][v]=d[v][u]=w;
   }
   
   rep(k,0,n)rep(i,0,n)rep(j,0,n)chmin(d[i][j],d[i][k]+d[k][j]);
   rep(mask,0,1<<n)dp[mask]=INF;
   dp[0]=0;
   rep(mask,0,1<<n){
      rep(to,0,n)if(!(mask>>to&1)){
         ll add=INF;
         rep(from,0,n)if(mask>>from&1){
            chmin(add,d[from][to]);
         }
         if(mask==0)add=0;
         chmin(dp[mask|(1<<to)],dp[mask]+add+a[to]);
      }
   }
   ll res=INF;
   rep(mask,0,1<<n)if(__builtin_popcountll(mask)==k)chmin(res,dp[mask]);
   cout<<res<<'\n';
   return 0;
}