#include "crocodile.h"

#include <iostream>
#include <vector>
#include <array>

using ll = long long;

std::vector<std::array<int, 2>> adj[1000];
ll dist[1000];
bool ex[1000];

void dfs(int i, int p){
	for(const auto &[x, d] : adj[i]) if(x != p) dfs(x, i);

	ll best[2] = {1ll<<61, 1ll<<61};

	for(const auto &[x, d] : adj[i]) if(x != p){
		ll cons = dist[x] + d;
		if(cons < best[0]) best[0] = cons;
		if(best[0] < best[1]) std::swap(best[0], best[1]);
	}

	if(!ex[i]) dist[i] = best[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) ex[p[i]] = 1;
	
	dfs(0, -1);

	return dist[0];
}