#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

int descending_compare(const void *a, const void *b){
    if (*(long long*)a > *(long long*)b){
        return -1;
    }else if (*(long long*)a == *(long long*)b){
        return 0;
    }else{
        return 1;
    }
}

int ascending_compare(const void *a, const void *b){
    if (*(int*)a < *(int*)b){
        return -1;
    }else if (*(int*)a == *(int*)b){
        return 0;
    }else{
        return 1;
    }
}


int lower_bound(int *a, int n, int key){
    int ng, mid, ok;
    ng = -1, ok = n-1;
    while (abs(ok - ng) > 1){
        mid = (ok + ng) / 2;
        if (key <= a[mid]){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    if (a[ok] >= key)return ok;
    return n;
}

//greatest common divisor
unsigned long gcd(unsigned long x, unsigned long y){
    if (y == 0){ 
        return x;
    }else if (x > y){
        return gcd(y, x % y);
    }else{
        return gcd(x, y % x);
    }
}

unsigned long lcm(unsigned long x, unsigned long y){
    unsigned long g = gcd(x, y);
    return x*y/g;

}



long long factorial(int x){
    long long rtn = 1;
    int i;
    for (i = x; i > 1; i--){
        rtn = (rtn*i);
    }
    return rtn;
}

/*
int struct_ascending_compare(const void *p, const void *q) {
return ((struct_name*)p)->member_name - ((struct_name*)q)->member_name;
}*/

/*unsigned long long pascal[100][100] = {0};
void make_pascal(void){
    for (int i = 0; i < 100; i++){
        pascal[i][0] = 1;
    }
    pascal[1][1] = 1;
    for (int i = 2; i < 100; i++){
        for (int j = 1; j < 100; j++){
           pascal[i][j] = (pascal[i-1][j-1]+pascal[i-1][j]);
        }
    }
}*/
long long mod = 1000000007;

long long mod_pow(long long x, long long n){
    long long res = 1;
    for(int i = 0;i < 60; i++){
        if(n >> i & 1) res = res * x % mod;
        x = x * x % mod;
    }
    return res;
}



int visit[10];
int edge[201][201] = {0};
int d[201][201];
int INF = 100000000;
int n;
int r;
int permulation[10];
int selected[10] = {0};

int ans;

int make_comb(int level){
    int final_d = 0;
    if (level == r){
        for (int i = 1; i < r; i++){
            final_d += d[permulation[i-1]][permulation[i]];
        }   
        ans = ans>final_d?final_d:ans;
    }

    for (int i = 0; i < r; i++){
        if (!selected[i]){
            selected[i] = 1;
            permulation[level] = visit[i];
            make_comb(level + 1);
            selected[i] = 0;
        }
    }

    return 0;

}


int main(void){
    ans = INF;
    for (int i = 0; i < 201; i++){
        for (int j = 0; j < 201; j++){
            d[i][j] = INF;
            edge[i][j] = INF;
        }
    }
    int m;
    int a, b, c;
    scanf("%d %d %d", &n, &m, &r);
    for (int i = 0; i < r; i++){
        scanf("%d", &visit[i]);
    }
    for (int i = 0; i < m; i++){
        scanf("%d %d %d", &a, &b, &c);
        d[a][b] = c;
        d[b][a] = c;
    }

    for (int k = 1; k <= n; k++){
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= n; j++){
                if (d[i][j] > d[i][k] + d[k][j]){
                    d[i][j] = d[i][k] + d[k][j];
                }
            }
        }
    }

    make_comb(0);

    printf("%d\n", ans);
    
    return 0;
}


Measured memory_bytes: 512