local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max

local n, m, rnum = io.read("*n", "*n", "*n")
local r = {}
for i = 1, rnum do r[i] = io.read("*n") end
local edge = {}
for i = 1, n do edge[i] = {} end
for i = 1, m do
  local u, v, l = io.read("*n", "*n", "*n")
  edge[u][v] = l
  edge[v][u] = l
end

local inf = 30000001

local function getlength(start_idx, dst_idx)
  local taskstate = {}
  for i = 1, n do taskstate[i] = false end
  local tasks = {}
  local tasknum = 0
  local done = 0

  local len = {}
  for i = 1, n do len[i] = inf end
  len[start_idx] = 0

  local function addtask(idx)
    if(not taskstate[idx]) then
      taskstate[idx] = true
      tasknum = tasknum + 1
      tasks[tasknum] = idx
    end
  end
  addtask(start_idx)

  while(done < tasknum) do
    done = done + 1
    local src = tasks[done]
    taskstate[src] = false
    for dst, cost in pairs(edge[src]) do
      if len[src] + cost < len[dst] then
        len[dst] = len[src] + cost
        addtask(dst)
      end
    end
  end
  return len[dst_idx]
end

local function heldkarp_prepare(n)
  local tot = 1
  local alltask = {}
  local stagetask = {}
  for i = 1, n do
    tot = tot * 2
    alltask[i] = {}
    stagetask[i] = {}
  end
  for i = 1, n do
    for j = 1, tot - 1 do
      alltask[i][j] = 20000001
    end
  end
  for i = 1, tot - 1 do
    local ti = i
    local cnt = 0
    for j = 1, n do
      if ti % 2 == 1 then
        cnt = cnt + 1
        ti = ti - 1
      end
      ti = ti / 2
    end
    table.insert(stagetask[cnt], i)
  end
  -- set first state
  local tmp = 1
  for i = 1, n do
    alltask[i][tmp] = 0
    tmp = tmp * 2
  end
  return tot, alltask, stagetask
end

local function heldkarp_doall(n, alltask, stagetask, len)
  for stage = 1, n - 1 do
    local stlen = #stagetask[stage]
    for i_stagetask = 1, stlen do
      local used = stagetask[stage][i_stagetask]
      local t_used = used
      for i = 1, n do
        if t_used % 2 == 1 then
          local val = alltask[i][used]
          local mul = 1
          local tmp = used
          for j = 1, n do
            if tmp % 2 == 0 then
              alltask[j][used + mul] = mmi(alltask[j][used + mul], val + len[(i - 1) * n + j])
            else
              tmp = tmp - 1
            end
            tmp = tmp / 2
            mul = mul * 2
          end
          t_used = t_used - 1
        end
        t_used = t_used / 2
      end
    end
  end
end

local function heldkarp_getresult(n, tot, alltask)
  local ret = alltask[1][tot - 1]
  for i = 2, n do
    ret = mmi(ret, alltask[i][tot - 1])
  end
  return ret
end


local len = {}
for i = 1, rnum * rnum do
  len[i] = 0
end
for i = 1, rnum - 1 do
  for j = i + 1, rnum do
    local l = getlength(r[i], r[j])
    len[(i - 1) * rnum + j] = l
    len[(j - 1) * rnum + i] = l
  end
end
local t1, t2, t3 = heldkarp_prepare(rnum)
heldkarp_doall(rnum, t2, t3, len)
print(heldkarp_getresult(rnum, t1, t2))
