#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100000 + 5;
const int MAX_M = 1000000 + 5;
bool is_exit[MAX_N], visited[MAX_M];
vector<pair<int, pair<int, long long>>> g[MAX_N];
long long solve(int u, int p) {
if (is_exit[u]) {
return 0;
}
long long mn_1 = 2e9, mn_2 = 2e9;
for (pair<int, pair<int, long long>> edge : g[u]) {
if (edge.second.first == p) continue;
if (visited[edge.first]) continue;
visited[edge.first] = true;
long long res = solve(edge.second.first, u) + edge.second.second;
if (res < mn_1) {
mn_2 = mn_1;
mn_1 = res;
}
else {
mn_2 = min(mn_2, res);
}
}
return mn_2;
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
for (int i=0 ; i<M ; i++) {
g[R[i][0]].push_back({ i, { R[i][1], L[i] }});
g[R[i][1]].push_back({ i, { R[i][0], L[i] }});
}
for (int i=0 ; i<K ; i++) {
is_exit[P[i]] = true;
}
return solve(0, -1);
}
