#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

const int MAX_N = 100010;
int par[MAX_N];
int rnk[MAX_N];
int siz[MAX_N];

void init(int n) {
    rep(i,0,n) {
        par[i] = i;
        rnk[i] = 0;
        siz[i] = 1;
    }
}

int find(int x) {
    if (par[x] == x) {
        return x;
    } else {
        return par[x] = find(par[x]);
    }
}

void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    int s = siz[x] + siz[y];
    if (rnk[x] < rnk[y]) {
        par[x] = y;
    } else {
        par[y] = x;
        if (rnk[x] == rnk[y]) rnk[x]++;
    }
    siz[find(x)] = s;
}

bool same(int x, int y) {
    return find(x) == find(y);
}

int size(int x) {
    return siz[find(x)];
}

int main() {
    int N, M, K;
    cin >> N >> M >> K;
    vector<ll> A(N), X(M), Y(M), Z(M);
    vector<vector<ll>> d(N, vector<ll>(N, 1e18));
    rep(i, 0, N) {
        cin >> A[i];
        d[i][i] = 0;
    }
    rep(i, 0, M) {
        cin >> X[i] >> Y[i] >> Z[i];
        d[X[i] - 1][Y[i] - 1] = Z[i];
        d[Y[i] - 1][X[i] - 1] = Z[i];
    }
    rep(k, 0, N) rep(i, 0, N) rep(j, 0, N) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
    ll ans = 1e18;
    rep(i, 0, 1 << N) {
        ll popcount = 0, Asum = 0;
        rep(j, 0, N) {
            if ((i >> j) & 1) {
                popcount++;
                Asum += A[j];
            }
        }
        if (popcount != K) continue;
        init(N);
        vector<vector<ll>> vc;
        rep(j, 0, N) {
            if (((i >> j) & 1) == 0) continue;
            rep(k, 0, j) {
                if (((i >> k) & 1) == 0) continue;
                vc.push_back({d[j][k], j, k});
            }
        }
        sort(vc.begin(), vc.end());
        ll roadcost = 0;
        rep(i, 0, vc.size()) {
            if (same(vc[i][1], vc[i][2])) continue;
            unite(vc[i][1], vc[i][2]);
            roadcost += vc[i][0];
        }
        ans = min(ans, Asum + roadcost);
    }
    cout << ans << endl;
}