#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define ll long long
#define ull unsigned long long
#define f first
#define s second
#define PF push_front
#define PB push_back
#define MP make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define max(a, b) ((a > b)? a : b)
#define min(a, b) ((a < b)? a : b)
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)
const int N = 1e3 + 5;
const int M = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll int INF = 1e18;
int _n, _m, _k;
vector<vector<pair<int, int>>> adj(N, vector<pair<int, int>>());
vector<bool> is_exit(N, false);
vector<int> dp(N);
void dfs(int cur, int prev = -1){
for(auto [child, w] : adj[cur]){
if(child == prev) continue;
dfs(child, cur);
}
if(is_exit[cur]){
dp[cur] = 0;
}else {
vector<int> cand;
for(auto [child, w] : adj[cur]){
if(child == prev) continue;
cand.PB(dp[child] + w);
}
sort(all(cand));
dp[cur] = cand[1];
}
}
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
_n = n;
_m = m;
_k = k;
for(int i = 0; i < m; i++){
adj[r[i][0]].PB(MP(r[i][1], l[i]));
adj[r[i][1]].PB(MP(r[i][0], l[i]));
}
for(int i = 0; i < k; i++) is_exit[p[i]] = true;
dfs(0);
return dp[0];
}
