#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
inline namespace
{
} // namespace
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
vector<vector<pair<int, long>>> adj(N);
for (int i = 0; i < M; i++)
adj[R[i][0]].emplace_back(R[i][1], L[i]),
adj[R[i][1]].emplace_back(R[i][0], L[i]);
vector<array<long, 2>> dist(N, {INT_MAX, INT_MAX});
priority_queue<pair<long, int>> pq;
for (int i = 0; i < K; i++)
dist[P[i]] = {0, 0}, pq.emplace(-dist[P[i]][0], P[i]);
vector<bool> done(N, 0);
while (!pq.empty())
{
auto [d, u] = pq.top();
pq.pop();
if (-d != dist[u][1])
continue;
if (done[u])
continue;
done[u] = 1;
for (auto [v, w] : adj[u])
{
long cost = w - d;
if (cost < dist[v][0])
dist[v][1] = dist[v][0],
dist[v][0] = cost;
else if (cost < dist[v][1])
dist[v][1] = cost;
else
continue;
pq.emplace(-dist[v][1], v);
}
}
return dist[0][1];
}
