#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<int>to[200005];
int popcount(long long n) {
	n = (n & 0x5555555555555555) + (n >> 1 & 0x5555555555555555);
	n = (n & 0x3333333333333333) + (n >> 2 & 0x3333333333333333);
	n = (n & 0x0f0f0f0f0f0f0f0f) + (n >> 4 & 0x0f0f0f0f0f0f0f0f);
	n = (n & 0x00ff00ff00ff00ff) + (n >> 8 & 0x00ff00ff00ff00ff);
	n = (n & 0x0000ffff0000ffff) + (n >> 16 & 0x0000ffff0000ffff);
	n = (n & 0x00000000ffffffff) + (n >> 32 & 0x00000000ffffffff);
	return n;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, c; cin >> n >> m >> c;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	vector<vector<long long>> dist(n, vector<long long>(n, LINF));
	rep(i, n)dist[i][i] = 0;
	rep(i, m) {
		int x, y, z; cin >> x >> y >> z; x--; y--;
		dist[x][y] = z;
		dist[y][x] = z;
	}
	//わーしゃるふろいど
	rep(k, n)rep(i, n)rep(j, n) chmin(dist[i][j], dist[i][k] + dist[k][j]);
	vector<long long>dp(1 << n, LINF);
	rep(i, n) dp[1 << i] = a[i];
	rep(i, 1 << n) {
		if (0 == i)continue;
		rep(j, n) {
			if (1 & (i >> j)) continue;
			int ni = i + (1 << j);
			long long cost = LINF;
			rep(k, n) {
				if (!(1 & (i >> k)))continue;
				chmin(cost, dist[k][j]);
			}
			chmin(dp[ni], dp[i] + a[j] + cost);
		}
	}
	long long ans = LINF;
	rep(i, 1 << n)if (c == popcount(i))chmin(ans, dp[i]);
	cout << ans << endl;
	return 0;
}