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 r = NList;
        var map = NArr(m);
        Array.Sort(r);

        var tree = new List<(int to, int len)>[n];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<(int to, int len)>();
        for (var i = 0; i < map.Length; ++i)
        {
            tree[map[i][0] - 1].Add((map[i][1] - 1, map[i][2]));
            tree[map[i][1] - 1].Add((map[i][0] - 1, map[i][2]));
        }

        var re = new int[k * 2 + 2];
        re[1] = n - 1;
        for (var i = 0; i < k; ++i)
        {
            re[i * 2 + 2] = map[r[i] - 1][0] - 1;
            re[i * 2 + 3] = map[r[i] - 1][1] - 1;
        }
        var mx = new int[k * 2 + 2, k * 2 + 2];
        for (var i = 0; i < re.Length; ++i)
        {
            var len = GetLen(re[i], tree);
            for (var j = 0; j < re.Length; ++j)
            {
                if (j < 2) mx[i, j] = len[re[j]];
                else mx[i, j] = len[re[j ^ 1]] + map[r[j / 2 - 1] - 1][2];
            }
        }
        var bitmax = 1 << k;
        var dp = new int[bitmax, k * 2];
        for (var i = 0; i < bitmax; ++i) for (var j = 0; j < k * 2; ++j) dp[i, j] = INF;
        dp[0, 0] = 0;
        for (var b = 0; b < bitmax; ++b)
        {
            if (b == 0)
            {
                for (var next = 0; next < k * 2; ++next) dp[1 << next / 2, next] = mx[0, next + 2];
            }
            else
            {
                for (var prev = 0; prev < k * 2; ++prev) for (var next = 0; next < k * 2; ++next)
                {
                    if ((b & (1 << prev / 2)) == 0) continue;
                    if ((b & (1 << next / 2)) != 0) continue;
                    dp[b | (1 << next / 2), next] = Math.Min(dp[b | (1 << next / 2), next], dp[b, prev] + mx[prev + 2, next + 2]);
                }
            }
        }
        var ans = INF;
        for (var i = 0; i < k * 2; ++i) ans = Math.Min(ans, dp[bitmax - 1, i] + mx[i + 2, 1]);
        WriteLine(ans);
    }
    static void DebugTable<T>(T[,] table)
    {
        Console.WriteLine("{");
        for (var i = 0; i < table.GetLength(0); ++i)
        {
            var s = i == 0 ? "{" : " ";
            for (var j = 0; j < table.GetLength(1); ++j)
            {
                s += j > 0 ? ", " : "";
                s += table[i, j].ToString();
            }
            s += i == table.GetLength(0) - 1 ? "}" : "";
            Console.WriteLine(s);
        }
        Console.WriteLine("}");
    }
    static int INF = int.MaxValue / 2;
    static int[] GetLen(int start, List<(int to, int len)>[] tree)
    {
        var ans = Enumerable.Repeat(INF, tree.Length).ToArray();
        ans[start] = 0;
        var q = new PriorityQueue<(int to, int len), int>();
        q.Enqueue((start, 0), 0);
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            if (ans[cur.to] != cur.len) continue;
            foreach (var next in tree[cur.to])
            {
                if (ans[next.to] <= cur.len + next.len) continue;
                ans[next.to] = cur.len + next.len;
                q.Enqueue((next.to, ans[next.to]), ans[next.to]);
            }
        }
        return ans;
    }
}