#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(deque <T> v);
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(queue <T> q) {cerr << "[ "; while(!q.empty()) {print(q.front()); cerr << " "; q.pop();} cerr << "]";}
template <class T> void print(priority_queue <T> q) {cerr << "[ "; while(!q.empty()) {print(q.top()); cerr << " "; q.pop();} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(int n__, T arr[]) {cerr << "[ "; for(int i = 0; i <= n__; i++) {print(arr[i]); cerr << " ";} cerr << "]\n";}
#define pb push_back
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define noAnsw cout << -1 << '\n'
#define ll long long
#define ppb pop_back
#define OK cout << "OK" << endl;
#define ld long double
#define all(v) (v).begin(), (v).end()
#define MP make_pair
#define PII pair <int, int>
#define endl '\n'
#define ull unsigned long long
#define PLL pair <ll, ll>
#define PIL pair <int, ll>
#define PLI pair <ll, int>
#define rall(v) (v).rbegin(), (v).rend()
#define priora priority_queue
#define urishOK cout << "urishOK\n";
const int inf = 1e9 + 5, LOG = 30;
const ll inf64 = 1e18 + 5, mod = 1e9 + 7, wmod = 998244353;
const double epsilon = 0.000001, pi = 3.14159265359;
vector <pair <int, ll>> T[100005];
bool is_exit[100005];
ll dist[100005][2];
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
for(int i = 0; i < n; i++){
for(int j = 0; j < 2; j++){
dist[i][j] = inf64;
}
}
for(int i = 0; i < m; i++){
T[r[i][0]].pb({r[i][1], l[i]});
T[r[i][1]].pb({r[i][0], l[i]});
}
priority_queue <pair <ll, int>> pq;
for(int i = 0; i < k; i++){
dist[p[i]][0] = 0;
pq.push({0, p[i]});
}
while(!pq.empty()){
int node = pq.top().second;
ll d = -pq.top().first;
pq.pop();
if(d > dist[node][1]) continue;
for(auto u : T[node]){
ll ndist = d + u.second;
if(ndist < dist[u.first][0]){
dist[u.first][1] = dist[u.first][0];
dist[u.first][0] = ndist;
if(dist[u.first][1] != inf64) pq.push({-ndist, u.first});
}
else if(ndist < dist[u.first][1]){
dist[u.first][1] = ndist;
pq.push({-ndist, u.first});
}
}
}
return dist[0][1];
}
