Problem:
Score : 400 points

Problem Statement

There are N towns in the State of Atcoder, connected by M bidirectional roads.

The i-th road connects Town A_i and B_i and has a length of C_i.

Joisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).

She will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.

If she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?

Constraints

2≤N≤200

1≤M≤N×(N-1)/2

2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)

r_i≠r_j (i≠j)

1≤A_i,B_i≤N, A_i≠B_i

(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)

1≤C_i≤100000

Every town can be reached from every town by road.

All input values are integers.

Input

Input is given from Standard Input in the following format:

N M R
r_1 ... r_R
A_1 B_1 C_1
:
A_M B_M C_M

Output

Print the distance traveled by road if Joisino visits the towns in the order that minimizes it.

Sample Input 1

3 3 3
1 2 3
1 2 1
2 3 1
3 1 4

Sample Output 1

2

For example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.

Sample Input 2

3 3 2
1 3
2 3 2
1 3 6
1 2 2

Sample Output 2

4

The shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.

Sample Input 3

4 6 3
2 3 4
1 2 4
2 3 3
4 3 1
1 4 1
4 2 2
3 1 6

Sample Output 3

3

Solution in Rust (1.42.0) (judge verdict: Accepted)

#![allow(non_snake_case,unused_imports,dead_code)]
use std::cmp::max;
use std::cmp::min;
use std::str::FromStr;
use std::collections::{HashMap,HashSet,VecDeque,BinaryHeap};
use std::cmp::Ordering;

use proconio::input;
use proconio::marker::{Chars,Usize1,Isize1};

fn comp_f64(a: &f64, b: &f64) -> Ordering {
    if a < b {
        return Ordering::Less;
    } else if a > b {
        return Ordering::Greater;
    }
    Ordering::Equal
}

fn main() {
    input!{
        N:usize,
        M:usize,
        L:usize,
        R:[Usize1;L],
        ABC:[(Usize1,Usize1,isize);M]
    }
    let INF = 1e15 as isize;
    let mut G = GraphWarshallFloyd::new(N,INF);
    for &(a,b,c) in &ABC{
        G.set(a,b,c);
        G.set(b,a,c);
    }
    G.run();
    let mut ans = INF;
    for S in Permutations::new(&R){
        ans = min(ans,f(L,&S,&G));
    }
    println!("{}",ans);
}

fn f(N:usize,V:&Vec<usize>,G:&GraphWarshallFloyd)->isize{
    let mut ret = 0;
    for i in 0..N-1{
        ret += G.get(V[i],V[i+1]);
    }
    ret
}

struct Permutations<'a,T:Copy>{
    N:usize,
    V:&'a Vec<T>,
    curr:Option<Vec<usize>>,
}
impl<T:Copy> Permutations<'_,T>{
    fn new(V:&Vec<T>) -> Permutations<T>{
        let N = V.len();
        Permutations{
            N:N,
            V:V,
            curr:None
        }
    }
    fn next_permutation(&mut self){
        if let Some(curr) = &mut self.curr{
            let mut i = self.N-1;
            let mut m = curr[self.N-1];
            for j in (0..self.N-1).rev(){
                if m>curr[j] { break;}
                m = curr[j];
                i = j;
            }
            if i==0{
                self.curr = None;
                return;
            }
            i -= 1;
            let mut done = 0usize;
            for j in 0..i{
                done |= 1<<curr[j];
            }
            for j in curr[i]+1..self.N{
                if done>>j&1 == 1 {continue;}
                curr[i] = j;
                done |= 1<<j;
                break;
            }
            let mut k = i+1;
            for j in 0..self.N{
                if done>>j&1 == 1 {continue;}
                curr[k] = j;
                k += 1;
            }
        } else {
            self.curr = Some((0..self.N).collect::<Vec<_>>());
        }
    }
}
impl<T:Copy> Iterator for Permutations<'_,T>{
    type Item = Vec<T>;
    fn next(&mut self)->Option<Vec<T>>{
        self.next_permutation();
        if let Some(curr) = &self.curr{
            let mut ret = Vec::new();
            for &i in curr {
                ret.push(self.V[i]);
            }
            Some(ret)
        } else {
            None
        }
    }
}

struct GraphWarshallFloyd{
    N:usize,
    Dist:Vec<Vec<isize>>,
    INF:isize
}

impl GraphWarshallFloyd {
    fn new(N:usize,INF:isize) -> GraphWarshallFloyd{
        let mut ret = GraphWarshallFloyd{N:N,Dist:Vec::new(),INF:INF};
        ret.Dist = vec![vec![INF;N];N];
        for i in 0..N{
            ret.Dist[i][i] = 0;
        }
        ret
    }
    fn set(&mut self,from:usize,to:usize,dist:isize){
        self.Dist[from][to] = dist;
    }
    fn get(&self,from:usize,to:usize)->isize{
        self.Dist[from][to]
    }
    fn run(&mut self){
        let N = self.N;
        for k in 0..N{
            for i in 0..N{
                for j in 0..N{
                    self.Dist[i][j] = min(self.Dist[i][j],self.Dist[i][k]+self.Dist[k][j]);
                }
            }
        }
    }
}