#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
#include "numeric"
#include "cassert"
#include "ctime"

using namespace std;

//constexpr long long int MOD = 1000000007;
//constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;
//constexpr long long int MOD = 998244353;
constexpr double EPS = 1e-8;

//int N, M, K, T, H, W, L, R;
long long int N, M, K, T, H, W, L, R;


int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N;
	vector<vector<long long>>edge(N, vector<long long>(N, 1LL << 44));
	for (int i = 0; i < N; i++) {
		edge[i][i] = 0;
	}
	cin >> M >> K;
	vector<long long>cost(N);
	for (auto& i : cost)cin >> i;
	for (int i = 0; i < M; i++) {
		cin >> L >> R >> H;
		L--, R--;
		edge[L][R] = H;
		edge[R][L] = H;
	}
	for (int k = 0; k < N; k++) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				edge[i][j] = min(edge[i][j], edge[i][k] + edge[k][j]);
			}
		}
	}
	vector<long long>dp(1 << N, 1LL << 44);
	dp[0] = 0;
	for (int i = 0; i < 1 << N; i++) {
		for (int j = 0; j < N; j++) {
			if (i >> j & 1)continue;
			long long add = 1LL << 44;
			if (i == 0)add = 0;
			for (int k = 0; k < N; k++) {
				if (i >> k & 1) {
					add = min(add, edge[j][k]);
				}
			}
			dp[i | (1 << j)] = min(dp[i | (1 << j)], dp[i] + add + cost[j]);
		}
	}
	long long ans = 1LL << 55;
	for (int i = 0; i <1<< N; i++) {
		int num = 0;
		for (int j = 0; j < N; j++) {
			if (i >> j & 1)num++;
		}
		if (num == K) {
			ans = min(ans, dp[i]);
		}
	}
	cout << ans << endl;
}