#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 10000000000000000



int main(){
	int n,m,K;
	cin>>n>>m>>K;
	
	vector<long long> a(n);
	rep(i,n)cin>>a[i];
	
	vector<vector<long long>> dis(n,vector<long long>(n,Inf));
	rep(i,n)dis[i][i] = 0;
	
	rep(i,m){
		int x,y,z;
		cin>>x>>y>>z;
		x--;y--;
		dis[x][y] = z;
		dis[y][x] = z;
	}
	
	rep(i,n){
		rep(j,n){
			rep(k,n){
				dis[j][k] = min(dis[j][k],dis[j][i]+dis[i][k]);
			}
		}
	}
	
	vector<long long> dp(1<<n,Inf);
	rep(i,n){
		dp[1<<i] = a[i];
	}
	
	rep(i,1<<n){
		rep(j,n){
			if((i>>j)&1)continue;
			long long ni = i | (1<<j);
			long long nv = Inf;
			rep(k,n){
				if((i>>k)&1){
					nv = min(nv,dis[k][j]);
				}
			}
			nv += a[j];
			nv += dp[i];
			dp[ni] = min(dp[ni],nv);
		}
	}
	long long ans = Inf;
	rep(i,1<<n){
		if(__builtin_popcount(i)==K)ans = min(ans,dp[i]);
	}
	
	cout<<ans<<endl;
	
	return 0;
}