#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

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

const int MAX=20;
const ll INF=1e15;

ll dis[MAX][MAX];
int n,m,k;

void floyd(){
  rep(k,n){
    rep(i,n){
      if(dis[i][k]==INF) continue;
      rep(j,n){
        if(dis[k][j]==INF) continue;
        dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
      }
    }
  }
}

class Dis{
  public:
  vector<ll> rank,p,siz;
  
  Dis(int s){
    rank.resize(s,0);
    p.resize(s,0);
    siz.resize(s,1);
    rep(i,s) makeSet(i);
  }
  
  void makeSet(int x){
    p[x]=x;
    rank[x]=0;
  }
  
  bool same(int x,int y){
    return findSet(x)==findSet(y);
  }
  
  void unite(int x,int y){
    if(same(x,y)) return;
    link(findSet(x),findSet(y));
  }
  
  void link(int x,int y){
    if(rank[x]>rank[y]){
      p[y]=x;
      siz[x]+=siz[y];
    }
    else{
      p[x]=y;
      siz[y]+=siz[x];
      if(rank[x]==rank[y]) rank[y]++;
    }
  }
  
  int findSet(int x){
    if(x != p[x]) p[x]=findSet(p[x]);
    return p[x];
  }
  
  int size(int x){
    return siz[findSet(x)];
  }
};

//辺e=(u,v)を{w(e),{u,v}}で表す
using Edge=pair<ll,pair<int,int>>;

ll kruskal(int n,vector<Edge> edges){
  sort(ALL(edges));
  ll res=0;
  int m=edges.size();
  Dis dset=Dis(n);
  
  rep(i,m){
    ll w=edges[i].first;
    int u=edges[i].second.first;
    int v=edges[i].second.second;
    
    if(dset.same(u,v)) continue;
    
    res+=w;
    dset.unite(u,v);
  }
  
  return res;
} 

int main(){
  cin>>n>>m>>k;
  
  vector<ll> A(n);
  rep(i,n) cin>>A[i];
  
  rep(i,n){
    rep(j,n){
      if(i==j) dis[i][j]=0;
      else dis[i][j]=INF;
    }
  }
  
  rep(i,m){
    int x,y;
    ll z;
    cin>>x>>y>>z;
    x--,y--;
    dis[x][y]=z;
    dis[y][x]=z;
  }
  
  floyd();
  
  ll mi=INF;
  for(int bit=0;bit<(1<<n);bit++){
    if(__builtin_popcount(bit)!=k) continue;
    vector<int> B;
    ll tmp=0;
    rep(i,n){
      if(bit&(1<<i)){
        B.push_back(i);
        tmp+=A[i];
      }
    }
    vector<Edge> edges;
    for(int i=0;i<k;i++){
      for(int j=i+1;j<k;j++){
        edges.push_back(Edge(dis[B[i]][B[j]],{i,j}));
      }
    }
    tmp+=kruskal(k,edges);
    mi=min(mi,tmp);
  }
  cout<<mi<<endl;
  
  return 0;
}