#include "crocodile.h"
#include <queue>
#include <vector>
#define vi vector<int>
#define pii pair<int, int>
#define fst first
#define snd second
#define vpi vector<pii>
using namespace std;
const int INF = 2e9;
priority_queue<pii, vector<pii>, greater<pii>> pq;
int dst[100001], mn[100001][2];
vpi adj[100001];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
for (int i = 0; i < N; i++)
{
dst[i] = mn[i][0] = mn[i][1] = INF;
}
for (int i = 0; i < M; i++)
{
int u = R[i][0], v = R[i][1];
adj[u].emplace_back(v, L[i]);
adj[v].emplace_back(u, L[i]);
}
for (int i = 0; i < K; i++)
{
dst[P[i]] = mn[P[i]][0] = mn[P[i]][1] = 0;
pq.emplace(0, P[i]);
}
while (pq.size())
{
int u = pq.top().snd; int d = pq.top().fst; pq.pop();
if (d == dst[u])
{
if (u == 0) break;
for (auto v : adj[u])
{
if (d + v.snd < mn[v.fst][0])
{
mn[v.fst][1] = mn[v.fst][0];
mn[v.fst][0] = d + v.snd;
}
else if (d + v.snd < mn[v.fst][1])
{
mn[v.fst][1] = d + v.snd;
}
if (mn[v.fst][1] < dst[v.fst])
{
dst[v.fst] = mn[v.fst][1];
pq.push({mn[v.fst][1], v.fst});
}
}
}
}
return dst[0];
}
