#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x)  cerr << "Line " << __LINE__ << ": " <<  #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;

template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;

template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};

const ll INF = (1ll<<62);
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;

template< typename T >
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}

  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};

template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;

template< typename T >
Matrix< T > WarshallFloyd_matrix(WeightedGraph< T > &g, T INF) {
  const ll V = g.size();
  Matrix<ll> D(V, vector<ll>(V, INF));
  REP(i, V) D[i][i] = 0;

  for(int i=0;i<V;i++){
      for(auto &e: g[i]){
          D[i][e.to] = e.cost;
      }
  }

  for(int k = 0; k < (int)D.size(); k++) {
    for(int i = 0; i < (int)D.size(); i++) {
      for(int j = 0; j < (int)D.size(); j++) {
        if(D[i][k] == INF || D[k][j] == INF) continue;
        D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
      }
    }
  }
  return D;
}

int main(){

    ll N, M, K;
    cin >> N >> M >> K;
    V<ll> A(N);
    REP(i, N) cin >> A[i];
    V<ll> X(M), Y(M), Z(M);
    REP(i, M) cin >> X[i] >> Y[i] >> Z[i], X[i]--, Y[i]--;

    WeightedGraph<ll> G(N);
    REP(i, M){
        G[X[i]].emplace_back(Y[i], Z[i]);
        G[Y[i]].emplace_back(X[i], Z[i]);
    }

    auto D = WarshallFloyd_matrix(G, INF);

    ll MA = 1<<N;
    V<ll> dp(MA, INF);
    dp[0] = 0;
    REP(mask, MA){
        REP(i, N){
            if(!(mask >> i & 1)){
                if(mask == 0){
                    chmin(dp[mask ^ (1<<i)], dp[mask] + A[i]);
                }else{
                    ll mi = INF;
                    REP(j, N){
                        if(mask >> j & 1){
                            chmin(mi, D[i][j]);
                        }
                    }
                    chmin(dp[mask ^ (1<<i)], dp[mask] + A[i] + mi);
                }
            }
        }
    }

    ll res = INF;
    REP(mask, MA){
        if(popcount(mask) == K) chmin(res, dp[mask]);
    }

    cout << res << endl;

    return 0;
}