local mfl, mce = math.floor, math.ceil
local bls, brs = bit.lshift, bit.rshift
local mmi, mma = math.min, math.max
local n, m, k = io.read("*n", "*n", "*n")
local r = {}
for i = 1, k do
  r[i] = io.read("*n")
end
local inf = 1000000007
local edge = {}
local len = {}
for i = 1, n do
  edge[i] = {}
  len[i] = {}
  for j = 1, n do
    len[i][j] = inf
  end
  len[i][i] = 0
end
local ea, eb, ec = {}, {}, {}
for i = 1, m do
  local a, b, c = io.read("*n", "*n", "*n")
  ea[i], eb[i], ec[i] = a, b, c
  table.insert(edge[a], i)
  table.insert(edge[b], i)
  len[a][b] = mmi(len[a][b], c)
  len[b][a] = len[a][b]
end
for z = 1, n do
  for i = 1, n do
    for j = 1, n do
      len[i][j] = mmi(len[i][j], len[i][z] + len[z][j])
    end
  end
end
local bittot = bls(1, k)
local waytot = 1
for i = 1, k do
  waytot = waytot * i
end

local function getpattern(n, patall, idx)
  local used = {}
  local retary = {}
  local div = patall
  for i = 1, n do used[i] = false end
  for i = n, 1, -1 do
    div = mfl(div / i)
    local v_idx = mfl(idx / div)
    idx = idx % div
    local tmp_idx = 0
    for j = 1, n do
      if not used[j] then
        if tmp_idx == v_idx then
          table.insert(retary, j)
          used[j] = true
          break
        else
          tmp_idx = tmp_idx + 1
        end
      end
    end
  end
  return retary
end
for i = 1, n do
  -- print(table.concat(len[i], " "))
end
local ret = inf * inf
for i = 0, waytot - 1 do
  local ary = getpattern(k, waytot, i)
  for j = 0, bittot - 1 do
    local tj = j
    local q = 0
    local pos = 1
    for z = 1, k do
      local d1, d2 = false, false
      if tj % 2 == 0 then
        d1, d2 = ea[r[ary[z]]], eb[r[ary[z]]]
      else
        d2, d1 = ea[r[ary[z]]], eb[r[ary[z]]]
      end
      q = q + len[pos][d1] + ec[r[ary[z]]]
      pos = d2
      tj = brs(tj, 1)
    end
    q = q + len[pos][n]
    ret = mmi(ret, q)
  end
end
print(ret)