#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
const int INF = 2e9+5;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
vector<vector<pair<int,int>>> adj(N);
vector<vector<int>> dist(N, vector<int>(2, INF));
for(int i = 0; i < M; ++i) {
int u = R[i][0], v = R[i][1];
int w = L[i];
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
for(int i = 0; i < K; ++i) {
q.push({0, P[i]});
dist[P[i]][0] = 0;
dist[P[i]][1] = 0;
}
while(!q.empty()) {
auto[cur_weight, u] = q.top(); q.pop();
if(dist[u][1] < cur_weight) continue;
for(auto[v, w] : adj[u]) {
if(cur_weight + w < dist[v][0]) {
if(dist[v][0] < dist[v][1]) q.push({dist[v][0], v});
dist[v][1] = dist[v][0];
dist[v][0] = cur_weight + w;
} else if(cur_weight + w < dist[v][1]) {
dist[v][1] = cur_weight + w;
q.push({dist[v][1], v});
}
}
}
return dist[0][1];
}
