#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const ll inf = 2e+18;
ll travel_plan(int n, int m, int r[][2], int l[], int k, int p[])
{
vector<pair<int, int>> adj[n];
for (int i = 0; i < m; i++)
adj[r[i][0]].push_back({r[i][1], l[i]}), adj[r[i][1]].push_back({r[i][0], l[i]});
vector<ll> d(n, inf);
priority_queue<pii, vector<pii>, greater<pii>> pq;
for (int i = 0; i < k; i++)
pq.push({0, p[i]}), d[p[i]] = 0;
vector<int> cnt(n, 0);
while (!pq.empty())
{
auto t = pq.top();
pq.pop();
ll dd = t.first, cur = t.second;
if (cnt[cur] > 2)
continue;
cnt[cur]++;
if (cnt[cur] == 2)
d[cur] = dd;
for (auto u : adj[cur])
{
int to = u.first, w = u.second;
pq.push({dd + w, to});
}
}
return d[0];
}
