#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
fn warshall_floyd(n:usize, graph: &mut Vec<Vec<i64>>) {
    use std::cmp::min;
    for k in 0..n {
        for i in 0..n {
            for j in 0..n {
                graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j]);
            }
        }
    }
}
// fn permutations(n: i32, m: i32, func: fn(&Vec<i32>) -> ()) {
//     fn perm(n: i32, m: i32, func: fn(&Vec<i32>) -> (), xs: &mut Vec<i32>) {
//         if m == 0 {
//             func(xs);
//         } else {
//             for x in 1 .. n + 1 {
//                 if !xs.contains(&x) {
//                     xs.push(x);
//                     perm(n, m - 1, func, xs);
//                     xs.pop();
//                 }
//             }
//         }
//     }
//     perm(n, m, func, &mut vec![]);
// }
// fn ret_vec(xs: &Vec<i32>) -> &Vec<i32> {
//     xs
// }
fn perm(m: usize, ru: &Vec<usize>, res: &mut Vec<Vec<usize>>, xs: &mut Vec<usize>) {
    if m == 0 {
        let x = xs.clone();
        res.push(x);
    } else {
        for x in ru {
            if !xs.contains(&x) {
                xs.push(*x);
                perm(m - 1, ru, res, xs);
                xs.pop();
            }
        }
    }
}
fn main() {
    input!{
        n: usize,
        m: usize,
        r: usize,
        ru: [usize1;r],
        abc: [(usize1, usize1, i64); m],
    }
    // println!("{:?}\n{:?}", ru, abc);
    // construction graph
    let mut graph:Vec<Vec<i64>> = vec![vec![1<<50;n];n];
    for &(a,b,c) in &abc {
        graph[a][b] = c;
        graph[b][a] = c;
    }
    // println!("{:?}", graph);
    // Warshall Floyd
    warshall_floyd(n, &mut graph);
    // all possible permutation
    let mut res = vec![];
    let mut xs = vec![];
    perm(ru.len(), &ru, &mut res, &mut xs);
    // println!("{:?}", res);
    let mut ans:i64 = 1<<50;
    for route in &res {
        // println!("{:?}", route);
        let mut route_len = 0;
        for i in 0..route.len()-1 {
            route_len += graph[route[i]][route[i+1]];
        }
        ans = std::cmp::min(ans, route_len);
    }
    println!("{}", ans);
}

Measured memory_bytes: 8444