#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int const MAXN=1e5+10;
vector<pair<int,int>>nei[MAXN]={};
bool ex[MAXN]={};
bool vis[MAXN]={};
bool comp(pair<int,int>a,pair<int,int>b)
{
return (a.second<=b.second);
}
int dfs(int n,int val)
{
if (ex[n])
return val;
vis[n]=1;
vector<int>g;
for (auto [j,w]:nei[n])
{
int f=1e9+10;
if (vis[j])
continue;
for (auto [i,w1]:nei[n])
{
if (i==j&&w==w1)
continue;
if (!vis[i])
f=min(f,dfs(i,val+w1));
}
g.push_back(f);
}
vis[n]=0;
sort(begin(g),end(g));
return g.back();
}
int ans=1e9+10;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
for (int i=0;i<M;i++)
{
nei[R[i][0]].push_back({R[i][1],L[i]});
nei[R[i][1]].push_back({R[i][0],L[i]});
}
for (int i=0;i<K;i++)
ex[P[i]]=1;
for (int i=0;i<N;i++)
sort(begin(nei[i]),end(nei[i]),comp);
return dfs(0,0);
}
