using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var a = NList;
        var map = NArr(m);
        var inf = long.MaxValue / 2;
        var len = new long[n, n];
        for (var i = 0; i < n; ++i) for (var j = 0; j < n; ++j) len[i, j] = inf;
        foreach (var road in map)
        {
            len[road[0] - 1, road[1] - 1] = road[2];
            len[road[1] - 1, road[0] - 1] = road[2];
        }
        for (var z = 0; z < n; ++z) for (var x = 0; x < n; ++x) for (var y = 0; y < n; ++y)
        {
            len[x, y] = Math.Min(len[x, y], len[x, z] + len[z, y]);
        }
        var bitmax = 1 << n;
        var dp = Enumerable.Repeat(inf, bitmax).ToArray();
        dp[0] = 0;
        for (var b = 0; b < bitmax; ++b)
        {
            if (b == 0)
            {
                for (var i = 0; i < n; ++i) dp[1 << i] = a[i];
            }
            else if (Popcount(b) >= k)
            {
                continue;
            }
            else
            {
                for (var i = 0; i < n; ++i)
                {
                    if ((b & (1 << i)) != 0) continue;
                    var near = inf;
                    for (var j = 0; j < n; ++j) if ((b & (1 << j)) != 0) near = Math.Min(near, len[i, j]);
                    dp[b | (1 << i)] = Math.Min(dp[b | (1 << i)], dp[b] + a[i] + near);
                }
            }
        }
        var ans = inf;
        for (var i = 0; i < bitmax; ++i) if (Popcount(i) == k) ans = Math.Min(ans, dp[i]);
        WriteLine(ans);
    }
    static int Popcount(long n)
    {
        var c = (n & 0x5555555555555555) + ((n>>1) & 0x5555555555555555);
        c = (c & 0x3333333333333333) + ((c>>2) & 0x3333333333333333);
        c = (c & 0x0f0f0f0f0f0f0f0f) + ((c>>4) & 0x0f0f0f0f0f0f0f0f);
        c = (c & 0x00ff00ff00ff00ff) + ((c>>8) & 0x00ff00ff00ff00ff);
        c = (c & 0x0000ffff0000ffff) + ((c>>16) & 0x0000ffff0000ffff);
        c = (c & 0x00000000ffffffff) + ((c>>32) & 0x00000000ffffffff);
        return (int)c;
    }
}