#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N, M, K;
  cin >> N >> M >> K;
  vector<ll> A(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }

  vector<vector<ll>> dist(N, vector<ll>(N, INF));
  for (ll i = 0; i < M; i++)
  {
    ll x, y, z;
    cin >> x >> y >> z;
    x--, y--;
    dist.at(x).at(y) = z;
    dist.at(y).at(x) = z;
  }
  for (ll i = 0; i < N; i++)
  {
    dist.at(i).at(i) = 0;
  }

  for (ll k = 0; k < N; k++)
  {
    for (ll i = 0; i < N; i++)
    {
      for (ll j = 0; j < N; j++)
      {
        chmin(dist.at(i).at(j), dist.at(i).at(k) + dist.at(k).at(j));
      }
    }
  }

  /*
  for (ll i = 0; i < N; i++)
  {
    for (ll j = 0; j < N; j++)
    {
      cerr << dist.at(i).at(j) << " ";
    }
    cerr << endl;
  }
  //*/
  
  vector<vector<ll>> cost(N, vector<ll>((1LL << N), INF));
  for (ll i = 0; i < N; i++)
  {
    for (ll b = 0; b < (1LL << N); b++)
    {
      for (ll j = 0; j < N; j++)
      {
        if (b & (1LL << j))
          chmin(cost.at(i).at(b), dist.at(i).at(j));
        if (b == 0)
          cost.at(i).at(b) = 0;
      }
    }
  }

  vector<vector<ll>> dp(K + 1, vector<ll>((1LL << N), INF));
  dp.at(0).at(0) = 0;
  for (ll i = 0; i < K; i++)
  {
    for (ll b = 0; b < (1LL << N); b++)
    {
      for (ll j = 0; j < N; j++)
      {
        if (b & (1LL << j))
          continue;

        ll nb = b | (1LL << j);
        if (chmin(dp.at(i + 1).at(nb), dp.at(i).at(b) + A.at(j) + cost.at(j).at(b)))
        {
          //cerr << i << " " << b << endl;
        }
      }
    }
  }

  ll ans = INF;
  for (ll b = 0; b < (1LL << N); b++)
  {
    chmin(ans, dp.at(K).at(b));
  }
  cout << ans << endl;
}