#include "crocodile.h"
#include<bits/stdc++.h>
#define F first
#define S second
using namespace std;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
vector<pair<int, int>> graph[N];
for (int i = 0; i < M; i++) {
graph[R[i][0]].push_back({R[i][1], L[i]});
graph[R[i][1]].push_back({R[i][0], L[i]});
}
const long long lim = 1e18 + 1;
priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> Q;
vector<int> degree(N, {0});
vector<pair<long long, long long>> mini(N, {lim, lim});
for (int i = 0; i < K; i++){
degree[P[i]] = 2;
Q.push({0, P[i]});
mini[P[i]] = {0, 0};
}
while (!Q.empty()){
pair<long long, int> v = Q.top();
Q.pop();
for (auto i: graph[v.S]){
degree[i.F]++;
if (mini[v.S].S + i.S < mini[i.F].F) mini[i.F].S = mini[i.F].F, mini[i.F].F = mini[v.S].S + i.S;
else if (mini[v.S].S + i.S < mini[i.F].S) mini[i.F].S = mini[v.S].S + i.S;
if (degree[i.F] == 2 && mini[i.F].S <= 1e9) Q.push({mini[i.F].S, i.F});
}
}
return (int)mini[0].S;
}
