#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[]) {
vvpll adj(N);
vpll dist(N, {1e9, 1e9});
priority_queue<pll, vpll, greater<pll>> pq;
for (int i = 0; i < K; i++) {
dist[P[i]] = {0, 0};
pq.push({0, P[i]});
}
for (int i = 0; i < M; i++) {
adj[R[i][0]].pb({R[i][1], L[i]});
adj[R[i][1]].pb({R[i][0], L[i]});
}
while (!pq.empty()) {
ll nodo = pq.top().s;
ll dis = pq.top().f;
pq.pop();
if (dis > dist[nodo].s) continue;
for (auto [vec, w] : adj[nodo]) {
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;
}
