#include "crocodile.h"
#include <bits/stdc++.h>
#define pi pair<int, int>
using namespace std;
vector<pair<int, int>> g[100010];
priority_queue<pi> pq;
int dis[100010][2], cd, cn, nd, nn;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
for(int i=0; i<M; i++) {
g[R[i][0]].push_back({R[i][1], L[i]});
g[R[i][1]].push_back({R[i][0], L[i]});
}
for(int i=0; i<=N; i++) {
dis[i][0] = 1e9;
dis[i][1] = 1e9;
}
for(int i=0; i<K; i++) {
pq.push({0, P[i]});
dis[P[i]][0] = 0;
dis[P[i]][1] = 0;
}
while(pq.size()) {
cd = pq.top().first;
cn = pq.top().second;
pq.pop();
cd = -cd;
if(dis[cn][1] < cd) continue;
for(auto i: g[cn]) {
nn = i.first;
nd = cd + i.second;
if(nd < dis[nn][0]) {
if(dis[nn][0] < dis[nn][1]) pq.push({-dis[nn][0], nn});
dis[nn][1] = dis[nn][0];
dis[nn][0] = nd;
} else if(nd < dis[nn][1]) {
dis[nn][1] = nd;
pq.push({-nd, nn});
}
}
}
return dis[0][1];
}
