#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
const int NN = 1e5 + 10;
#define ll long long
vector<pair<int, ll>> adj[NN];
ll dp[1001][2];
bool ka[NN];
void dfs(int node, int parent) {
bool leaf = 1;
for (auto [u, v] : adj[node]) {
if (u == parent) continue;
leaf = 0;
dfs(u, node);
if (dp[u][1] + v <= dp[node][0]) {
dp[node][1] = dp[node][0];
dp[node][0] = dp[u][1] + v;
}else if(dp[u][1] + v <= dp[node][1]){
dp[node][1] = dp[u][1] + v;
}
}
if (leaf && ka[node]) dp[node][0] = dp[node][1] = 0;
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
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] });
}
for (int i = 0; i < K; i++) ka[P[i]] = 1;
for (int i = 0; i < N; i++) {
dp[i][0] = dp[i][1] = INT64_MAX;
}
dfs(0, 0);
return dp[0][1];
}
