#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

struct UnionFind{
    vector<int> par,num;
    UnionFind(int n):par(n),num(n,1){
        iota(par.begin(),par.end(),0);  //include<numeric>
    }
    int find(int v){
        return (par[v]==v)?v:(par[v]=find(par[v]));
    }
    void unite(int u,int v){
        u=find(u),v=find(v);
        if(u==v)return;
        if(num[u]<num[v])swap(u,v);
        num[u]+=num[v];
        par[v]=u;
    }
    bool same(int u,int v){
        return find(u) == find(v);
    }
    int size(int v){
        return num[find(v)];
    }
};

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m,k; cin >> n >> m >> k;
    vector<ll> a(n);
    vector<vector<ll>> d(n,vector<ll>(n,1LL<<60));
    for(int i=0;i<n;i++){
        cin >> a[i];
        d[i][i] = 0;
    }
    for(int i=0;i<m;i++){
        int x,y,z; cin >> x >> y >> z;
        x--; y--;
        d[x][y] = d[y][x] = z;
    }
    for(int k=0;k<n;k++){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
            }
        }
    }
    ll res = (1LL<<60);
    vector<pair<ll,pair<int,int>>> v; 
    for(int i=0;i<(1<<n);i++){
        if(__builtin_popcount(i) != k)continue;
        ll sum = 0;
        v.clear();
        UnionFind uf(n);
        for(int j=0;j<n;j++){
            if((1<<j)&i){
                sum += a[j];
                for(int k=j+1;k<n;k++){
                    if((1<<k)&i){
                        v.push_back({d[j][k],{j,k}});
                    }
                }
            }
        }
        sort(v.begin(), v.end());
        for(auto &p:v){
            if(uf.same(p.second.first,p.second.second))continue;
            uf.unite(p.second.first,p.second.second);
            sum += p.first;
        }
        res = min(res,sum);
    }
    cout << res << endl;
}