#include<cstdio>

 #include<cstring>

 #include<iostream>

 const int MAX = 0xfffff,SIZE = +;

 int T1,S,D,map[SIZE][SIZE],f,T[SIZE],visit[SIZE];

 int main() {

     int a,b,len,x,y;

     while(scanf("%d%d%d",&T1,&S,&D)!=EOF) {

         memset(map,0x3f,sizeof(map));

         memset(T,0x3f,sizeof(T));

         printf("%d\n",T[]);

         f = ;

         for(int i = ;i<=T1;++i) {

             scanf("%d%d%d",&a,&b,&len);

             f = std::max(a,f);    //找到编号最大的点以确定范围

             f = std::max(b,f);

             map[a][b] = map[b][a] = std::min(len,map[a][b]);

             //如果有多条路径，取权值最小的

         }

         for(int i = ;i<=S;++i) { //增加虚拟起点到草儿家附近的城市的距离

             scanf("%d",&a);

             map[][a] = map[a][] = ;

         }

         f++;      //增加一个虚拟的终点

         for(int i = ;i<=D;++i) { //增加虚拟起点到草儿想去的城市的距离

             scanf("%d",&a);

             map[f][a] = map[a][f] = ;

         }

         int s = ;

         T[s] = ;

         memset(visit,,sizeof(visit));

         while() {

             if(s == f)

             break;

             for(int i = ;i<=f;++i)

             if(!visit[i]&&(T[i]>(T[s]+map[s][i])))

             T[i] = T[s]+map[s][i];

             visit[s] = ;

             s = f+;

             bool flag = ;

             for(int i = ;i<=f;++i)

             if(!visit[i]&&T[i]<T[s]) {

                 s = i;

                 flag = ;

             }

             if(flag)

             break;

         }

         printf("%d\n",T[f]-);

     }

     return ;

 }