#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename CostType>
struct Edge {
  int src, dst; CostType cost;
  Edge(int src, int dst, CostType cost = 0) : src(src), dst(dst), cost(cost) {}
  inline bool operator<(const Edge &x) const {
    return cost != x.cost ? cost < x.cost : dst != x.dst ? dst < x.dst : src < x.src;
  }
  inline bool operator<=(const Edge &x) const { return !(x < *this); }
  inline bool operator>(const Edge &x) const { return x < *this; }
  inline bool operator>=(const Edge &x) const { return !(*this < x); }
};

int main() {
  int n, m, k; cin >> n >> m >> k;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<vector<Edge<int>>> graph(n);
  while (m--) {
    int x, y, z; cin >> x >> y >> z; --x; --y;
    graph[x].emplace_back(x, y, z);
    graph[y].emplace_back(y, x, z);
  }
  vector dist(1 << n, vector(n, LINF));
  FOR(b, 1, 1 << n) {
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> que;
    REP(i, n) {
      if (b >> i & 1) {
        dist[b][i] = 0;
        que.emplace(0, i);
      }
    }
    while (!que.empty()) {
      auto [cost, city] = que.top(); que.pop();
      if (cost > dist[b][city]) continue;
      for (const Edge<int> &e : graph[city]) {
        if (chmin(dist[b][e.dst], cost + e.cost)) que.emplace(dist[b][e.dst], e.dst);
      }
    }
  }
  vector<ll> dp(1 << n, LINF);
  REP(i, n) dp[1 << i] = a[i];
  FOR(b, 1, 1 << n) {
    REP(i, n) {
      if (b >> i & 1) continue;
      chmin(dp[b | (1 << i)], dp[b] + a[i] + dist[b][i]);
    }
  }
  ll ans = LINF;
  REP(b, 1 << n) {
    if (__builtin_popcount(b) == k) chmin(ans, dp[b]);
  }
  cout << ans << '\n';
  return 0;
}