#include "crocodile.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e15;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
int32_t travel_plan(int32_t n, int32_t m, int32_t r[][2], int32_t l[], int32_t k, int32_t p[])
{
vector <pii> adj[n];
for (int i = 0; i < m; i++) {
adj[r[i][0]].emb(l[i], r[i][1]);
adj[r[i][1]].emb(l[i], r[i][0]);
}
vector <int> dis1(n + 1, inf), dis2(n + 1, inf);
priority_queue <pii, vector <pii>, greater <pii>> q;
for (int i = 0; i < k; i++) {
dis1[p[i]] = dis2[p[i]] = 0;
q.emplace(dis1[p[i]], p[i]);
}
while (!q.empty()) {
auto [w, u] = q.top(); q.pop();
if (w > dis2[u]) continue;
for (auto [ww, v] : adj[u]) {
int nw = w + ww;
if (nw < dis1[v]) {
dis2[v] = dis1[v];
dis1[v] = nw;
if (dis2[v] != inf) q.emplace(dis2[v], v);
}
else if (nw < dis2[v]) {
dis2[v] = nw;
q.emplace(dis2[v], v);
}
}
}
return dis2[0];
}
