#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
vector<vector<pair<int, int>>> 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<int> cnts(N);
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
for (int i = 0; i < K; ++i) {
q.emplace(0, P[i]);
q.emplace(0, P[i]);
}
while (!q.empty()) {
int d, v; tie(d, v) = q.top(); q.pop();
if (++cnts[v] == 2) {
if (v == 0) return d;
for (auto e : adj[v]) {
q.emplace(d + e.second, e.first);
}
}
}
assert(false);
}
