#include<bits/stdc++.h>
#define fi first
#define se second
#define rep(a, b) for(int a = 0; a < (int)(b); a++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e5+10;
vector<pair<int,ll> > graf[N];
int vis[N];
ll travel_plan(int n,int m,int r[][2],int l[],int k,int p[]){
rep(i,m) graf[r[i][0]].push_back({r[i][1],l[i]}),graf[r[i][1]].push_back({r[i][0],l[i]});
set<pair<ll,int> >s;
rep(i,k) s.insert({0,p[i]}),vis[p[i]]=1;
while(!s.empty()){
auto it=s.begin();
s.erase(it);
int v=(*it).se;
ll c=(*it).fi;
if(vis[v]==0){vis[v]=1;continue;}
if(vis[v]>1) continue;
vis[v]++;
if(v==0) return c;
for(auto u:graf[v]){
ll c2=c+u.se;
if(vis[u.fi]<2) s.insert({c2,u.fi});
}
}
return 0;
}
