import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const K = readInt();
      auto A = new long[N];
      foreach (u; 0 .. N) {
        A[u] = readLong();
      }
      auto X = new int[M];
      auto Y = new int[M];
      auto Z = new long[M];
      foreach (i; 0 .. M) {
        X[i] = readInt() - 1;
        Y[i] = readInt() - 1;
        Z[i] = readLong();
      }
      
      auto dist = new long[][](N, N);
      foreach (u; 0 .. N) {
        dist[u][] = INF;
        dist[u][u] = 0;
      }
      foreach (i; 0 .. M) {
        chmin(dist[X[i]][Y[i]], Z[i]);
        chmin(dist[Y[i]][X[i]], Z[i]);
      }
      foreach (w; 0 .. N) foreach (u; 0 .. N) foreach (v; 0 .. N) {
        chmin(dist[u][v], dist[u][w] + dist[w][v]);
      }
      
      auto dp = new long[1 << N];
      dp[] = INF;
      foreach (u; 0 .. N) {
        dp[1 << u] = A[u];
      }
      foreach (p; 1 .. 1 << N) {
        foreach (v; 0 .. N) if (!(p & 1 << v)) {
          long cost = INF;
          foreach (u; 0 .. N) if (p & 1 << u) {
            chmin(cost, dist[u][v]);
          }
          chmin(dp[p | 1 << v], dp[p] + cost + A[v]);
        }
      }
      
      long ans = INF;
      foreach (p; 0 .. 1 << N) {
        if (popcnt(p) == K) {
          chmin(ans, dp[p]);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}