#include "crocodile.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<bool>vis;
vector<vector<pair<int,int>>>v;
vector<priority_queue<int>>dp;
const int INF=1e9;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
vis.assign(N,false);
v.resize(N);
for(int i=0;i<M;i++){
v[R[i][0]].push_back({R[i][1],L[i]});
v[R[i][1]].push_back({R[i][0],L[i]});
}
dp.resize(N);
priority_queue<pair<int,int>>q;
for(int i=0;i<K;i++){
q.push({0,P[i]});
dp[P[i]].push(0);
}
while(!q.empty()){
auto [d,x]=q.top();
q.pop();
if(vis[x]) continue;
vis[x]=true;
for(auto [z,w]:v[x]){
if(vis[z]) continue;
if(dp[z].size()<2){
dp[z].push(dp[x].top()+w);
}
else if(dp[x].top()+w<dp[z].top()){
dp[z].pop();
dp[z].push(dp[x].top()+w);
}
if(dp[z].size()==2){
q.push({-dp[z].top(),z});
}
}
}
return dp[0].top();
}
