#include "crocodile.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
typedef vector<vvi> vvvi;
typedef vector<vvl> vvvl;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
vector<pll> dist(N,mp(1e20,1e20));
priority_queue<pll, vector<pll>, greater<pll>> pq;
vector<vector<pll>> adj(N);
for(int i=0;i<K;i++){
dist[P[i]].f=0;
dist[P[i]].s=0;
pq.push(mp(0,P[i]));
}
for(int i=0;i<M;i++){
adj[R[i][0]].pb(mp(R[i][1],L[i]));
adj[R[i][1]].pb(mp(R[i][0],L[i]));
}
while (!pq.empty()) {
int nodo=pq.top().s;
int dis=pq.top().f;
pq.pop();
if (dis > dist[nodo].s) continue;
for (auto x : adj[nodo]) {
int vec=x.f;
int w=x.s;
if (dist[nodo].s+w < dist[vec].f){
dist[vec].s=dist[vec].f;
dist[vec].f=dist[nodo].s+w;
if(dist[vec].s!=1e9){
pq.push({dist[vec].s, vec});
}
}else if(dist[nodo].s+w < dist[vec].s){
dist[vec].s=dist[nodo].s+w;
pq.push({dist[vec].s, vec});
}
}
}
return dist[0].s;
}
