家为0,家到各个源点的距离看成0,遍历几个汇点,取最小即可
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#define inf 999999999
#define maxn 1005
using namespace std;
int g[maxn][maxn];
int dist[maxn];
int vis[maxn];
int t,s,d,n;
void dijkstra(int st){
int i,j,mindis,u;
memset(vis,0,sizeof(vis));
for(i=0;i<=n;i++){
dist[i]=g[st][i];
}
vis[st]=1;
for(i=0;i<=n;i++){
mindis=inf;
u=-1;
for(j=0;j<=n;j++){
if(!vis[j]&&mindis>dist[j]){
mindis=dist[j];
u=j;
}
}
if(u==-1)break;
vis[u]=1;
for(j=0;j<=n;j++){
if(!vis[j]&&dist[j]>dist[u]+g[u][j]){
dist[j]=dist[u]+g[u][j];
}
}
}
}
int main(){
int i,j;
while(scanf("%d%d%d",&t,&s,&d)!=EOF){
for(i=0;i<maxn;i++){
for(j=0;j<maxn;j++){
if(i==j)g[i][j]=0;
else g[i][j]=inf;
}
dist[i]=inf;
}
n=0;
for(i=0;i<t;i++){
int a,b,x;
scanf("%d%d%d",&a,&b,&x);
n=max(n,a);
n=max(n,b);
if(g[a][b]>x){
g[a][b]=g[b][a]=x;
}
}
int a[maxn];
for(i=1;i<=s;i++){
int x;
scanf("%d",&x);
g[0][x]=g[x][0]=0;
}
for(i=1;i<=d;i++){
scanf("%d",&a[i]);
}
dijkstra(0);
int mmin=inf;
for(i=1;i<=d;i++){
mmin=min(mmin,dist[a[i]]);
}
printf("%d\n",mmin);
}
return 0;
}