#include "atcoder/modint.hpp"
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>
#include <cstddef>
#include <type_traits>
#include <vector>

using namespace std;
const long long int INF = numeric_limits<long long int>::max() / 4;
const int inf = numeric_limits<int>::max() / 4;
const long long int MOD1000000007 = 1000000007;
const long long int MOD998244353 = 998244353;
const double MATH_PI = 3.1415926535897932;

template<typename T1, typename T2>
inline void chmin(T1 &a, const T2 &b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, const T2 &b) { if (a < b) a = b; }

#define lint long long int
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define VI vector<int>
#define VLL vector<long long>
#define VC vector<char>
#define VB vector<bool>
#define PI pair<int, int>
#define PLL pair<long long, long long>
#define VPI vector<pair<int, int>>
#define VPLL vector<pair<long long, long long>>
#define VVI vector<vector<int>>
#define VVPI vecor<vector<pair<int, int>>>
#define VVPILL vector<vector<pair<int, long long>>>

#define SUM(v) accumulate(ALL(v), 0LL)
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))

int main() {

    int n, m, k; cin >> n >> m >> k;
    vector<lint> a(n);
    rep (i, n) {
        cin >> a[i];
    }

    vector<vector<lint>> g(n, vector<lint>(n, INF));
    rep (i, n) {
        g[i][i] = 0;
    }
    rep (i, m) {
        lint u, b, c; cin >> u >> b >> c;
        u--;
        b--;
        g[u][b] = g[b][u] = c;
    }
    rep (kk, n) rep (i, n) rep(j, n) {
        chmin(g[i][j], g[i][kk] + g[kk][j]);
    }

    vector<lint> dp(1 << n, INF);
    rep (i, n) {
        dp[1 << i] = a[i];
    }

    for (int bit = 0; bit < (1 << n); bit++) {
        if (dp[bit] == INF) continue;
        for (int u = 0; u < n; u++) {
            if (bit & (1 << u)) continue;
            lint nbit = bit | (1 << u);
            lint cost = INF;
            for (int v = 0; v < n; v++) {
                if (bit & (1 << v)) {
                    chmin(cost, g[u][v] + a[u]);
                }
            }
            chmin(dp[nbit], dp[bit] + cost);
        }
    }
    lint ans = INF;
    for (int bit = 0; bit < (1 << n); bit++) {
        if (__builtin_popcount(bit) == k) {
            chmin(ans, dp[bit]);
        }
    }
    cout << ans << endl;
    return 0;
}