#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<pair<int,int>> adjlst[100100];
long long int d[100100];
int visited[100100];
priority_queue<pair<long long int, int>,vector<pair<long long int, int>>,greater<pair<long long int, int>>> pq;
for(int i = 0; i < M; i++){
adjlst[R[i][0]].push_back(make_pair(R[i][1],L[i]));
adjlst[R[i][1]].push_back(make_pair(R[i][0],L[i]));
}
for(int i = 0 ; i < N; i++){
d[i] = 1100100100100100100;
visited[i] = 0;
}
for(int i = 0; i < K; i++){
visited[P[i]] = 1;
pq.push(make_pair(0,P[i]));
}
while(!pq.empty()){
long long int de = pq.top().first;
int i = pq.top().second;
pq.pop();
if(visited[i] == 1){
d[i] = de;
for(pair<int,int> ii : adjlst[i]){
if(visited[ii.first] > 1) continue;
pq.push(make_pair(de + ii.second, ii.first));
}
}
visited[i]++;
}
return d[0];
}
