package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func main() {
	sc := NewScanner()
	N, M, R := sc.NextInt(), sc.NextInt(), sc.NextInt()
	r := sc.NextIntArray()
	sort.Ints(r)
	edge := make([][]int, N+1)

	for i := 0; i < len(edge); i++ {
		edge[i] = make([]int, N+1)
		for j := 0; j < len(edge[i]); j++ {
			edge[i][j] = 1e8
		}
		edge[i][i] = 0
	}

	for i := 0; i < M; i++ {
		A, B, C := sc.NextInt(), sc.NextInt(), sc.NextInt()
		edge[A][B] = min(edge[A][B], C)
		edge[B][A] = min(edge[B][A], C)
	}

	for k := 1; k <= N; k++ {
		for i := 1; i <= N; i++ {
			for j := 1; j <= N; j++ {
				if edge[i][j] > edge[i][k]+edge[k][j] {
					edge[i][j] = edge[i][k] + edge[k][j]
				}
			}
		}
	}

	//	fmt.Printf("%+v", edge)

	dp := make([][]int, 1<<uint(R))
	for i := 0; i < len(dp); i++ {
		dp[i] = make([]int, R)
		for j := 0; j < len(dp[i]); j++ {
			dp[i][j] = 1e8
		}
	}

	for i := 0; i < R; i++ {
		dp[1<<uint(i)][i] = 0
	}

	for i := uint(0); i < 1<<uint(R); i++ {
		for j := uint(0); j < uint(R); j++ {
			if dp[i][j] == 1e8 {
				continue
			}
			for k := uint(0); k < uint(R); k++ {
				dp[i|1<<k][k] = min(dp[i|1<<k][k], dp[i][j]+edge[r[j]][r[k]])
			}
		}
	}
	mn := -1
	for i := 0; i < R; i++ {
		if mn < 0 || mn > dp[1<<uint(R)-1][i] {
			mn = dp[1<<uint(R)-1][i]
		}
	}

	fmt.Println(mn)

}

func next_perm(p []int) bool {
	i := len(p) - 1
	for i > 0 && p[i-1] > p[i] {
		i--
	}
	if i == 0 {
		return false
	}
	i--
	j := len(p) - 1
	for p[j] < p[i] {
		j--
	}
	p[i], p[j] = p[j], p[i]
	i, j = i+1, len(p)-1
	for i < j {
		p[i], p[j] = p[j], p[i]
		i, j = i+1, j-1
	}
	return true
}

func min(a int, b int) int {
	if a < b {
		return a
	}
	return b
}

type Scanner struct {
	r   *bufio.Reader
	buf []byte
	p   int
}

func NewScanner() *Scanner {
	rdr := bufio.NewReaderSize(os.Stdin, 1000)
	return &Scanner{r: rdr}
}
func (s *Scanner) Next() string {
	s.pre()
	start := s.p
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			break
		}
	}
	result := string(s.buf[start:s.p])
	s.p++
	return result
}
func (s *Scanner) NextLine() string {
	s.pre()
	start := s.p
	s.p = len(s.buf)
	return string(s.buf[start:])
}
func (s *Scanner) NextInt() int {
	v, _ := strconv.Atoi(s.Next())
	return v
}
func (s *Scanner) NextInt64() int64 {
	v, _ := strconv.ParseInt(s.Next(), 10, 64)
	return v
}

func (s *Scanner) NextIntArray() []int {
	s.pre()
	start := s.p
	result := []int{}
	for ; s.p < len(s.buf)+1; s.p++ {
		if s.p == len(s.buf) || s.buf[s.p] == ' ' {
			v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 0)
			result = append(result, int(v))
			start = s.p + 1
		}
	}

	return result
}
func (s *Scanner) NextInt64Array() []int64 {
	s.pre()
	start := s.p
	result := []int64{}
	for ; s.p < len(s.buf)+1; s.p++ {
		if s.p == len(s.buf) || s.buf[s.p] == ' ' {
			v, _ := strconv.ParseInt(string(s.buf[start:s.p]), 10, 64)
			result = append(result, v)
			start = s.p + 1
		}
	}
	return result
}

func (s *Scanner) NextMap() map[int]bool {
	s.pre()
	start := s.p
	mp := map[int]bool{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			mp[v] = true
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	mp[v] = true

	return mp
}

func (s *Scanner) pre() {
	if s.p >= len(s.buf) {
		s.readLine()
		s.p = 0
	}
}
func (s *Scanner) readLine() {
	s.buf = make([]byte, 0)
	for {
		l, p, e := s.r.ReadLine()
		if e != nil {
			panic(e)
		}
		s.buf = append(s.buf, l...)
		if !p {
			break
		}
	}
}


Measured memory_bytes: 1536