/* -*- coding: utf-8 -*-
 *
 * 1690.cc:  No.1690 Power Grid - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 18;
const int NBITS = 1 << MAX_N;
const long long LINF = 1LL << 60;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N];
ll ds[MAX_N][MAX_N];
ll dp[NBITS];

/* subroutines */

inline void setmin(ll &a, ll b) { if (a > b) a = b; }

inline int bnums(int bits) {
  int c = 0;
  for (; bits > 0; bits >>= 1)
    if (bits & 1) c++;
  return c;
}

/* main */

int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);

  for (int i = 0; i < n; i++) scanf("%d", as + i);

  for (int i = 0; i < n; i++)
    fill(ds[i], ds[i] + n, LINF), ds[i][i] = 0;

  for (int i = 0; i < m; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    x--, y--;
    ds[x][y] = ds[y][x] = z;
  }

  for (int h = 0; h < n; h++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++)
	ds[i][j] = min(ds[i][j], ds[i][h] + ds[h][j]);

  int nbits = 1 << n;
  fill(dp, dp + nbits, LINF);

  for (int i = 0; i < n; i++) dp[1 << i] = as[i];

  for (int bits = 1; bits < nbits; bits++) {
    for (int i = 0, bi = 1; i < n; i++, bi <<= 1)
      if (! (bits & bi)) {
	ll mind = LINF;
	for (int j = 0, bj = 1; j < n; j++, bj <<= 1)
	  if (bits & bj) mind = min(mind, ds[i][j]);

	setmin(dp[bits | bi], dp[bits] + as[i] + mind);
      }
  }

  ll mindp = LINF;
  for (int bits = 1; bits < nbits; bits++)
    if (bnums(bits) == k) setmin(mindp, dp[bits]);

  printf("%lld\n", mindp);
  return 0;
}