#include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,n) for(int i=0;i<(int)(n);++i) #define iter(a) __typeof(a.begin()) #define FOR(it,a) for(iter(a)it=a.begin();it!=a.end();++it) #define F first #define S second #define SZ(a) (int)((a).size()) #define sz(a) SZ(a) #define pb(a) push_back(a) #define mp(a,b) make_pair(a,b) #define ALL(a) (a).begin(),(a).end() using namespace std; typedef long long ll; typedef pair PI; typedef unsigned long long ull; #define PR(...) do{cerr << "line : " << __LINE__ << endl; pr(#__VA_ARGS__, __VA_ARGS__);}while(0); template void pr(const string& name, T t){ cerr << name << ": " << t << endl; } template void pr(const string& names, T t, Types ... rest) { auto comma_pos = names.find(','); cerr << names.substr(0, comma_pos) << ": " << t << ", "; auto next_name_pos = names.find_first_not_of(" \t\n", comma_pos + 1); pr(string(names, next_name_pos), rest ...); } template ostream& operator<< (ostream& o, const pair& v){return o << "(" << v.F << ", " << v.S << ")";} template ostream& operator<< (ostream& o, const vector& v){o << "{";rep(i,SZ(v)) o << (i?", ":"") << v[i];return o << "}";} const int dx[] = {0,1,0,-1}; const int dy[] = {-1,0,1,0}; #define endl '\n' const int MAX_N=40; int cost[MAX_N][MAX_N]; const int THRESHOLD=14; int dp[1<> n >> m >> t; rep(i,n)rep(j,n) cost[i][j] = 1e9; vector > ed; rep(i,m){ int a,b,c; cin >> a >> b >> c; --a,--b; ed.pb(mp(c,mp(a,b))); cost[b][a] = cost[a][b] = min(cost[a][b],c); } rep(i,n) cost[i][i] = 0; rep(k,n)rep(i,n)rep(j,n){ if(cost[i][j] >= cost[i][k] + cost[k][j] && i != k && k != j){ db[i][j] = 1; db[j][i] = 1; } cost[i][j] = min(cost[i][j], cost[i][k]+cost[k][j]); } vector terminal(t); rep(i, t){ cin >> terminal[i]; --terminal[i]; } if(t>THRESHOLD){ sort(ALL(ed)); { vector > ned; for(auto e : ed) if(!db[e.S.F][e.S.S]) ned.pb(e); ed = ned; } //PR(m,SZ(ed)); vector nont; sort(ALL(terminal)); rep(i,n) if(!binary_search(ALL(terminal),i)) nont.pb(i); //cout << nont << endl; int ans = 1e9; rep(i,1<<(n-t)){ bool use[35] = {}; int comp = t-1; rep(j,n-t) comp += use[nont[j]] = (i>>j)&1; rep(j,t) use[terminal[j]] = true; rep(j,n) un[j] = j; int cc = 0; for(const auto& e : ed){ if(!use[e.S.F] || !use[e.S.S]) continue; int a = find(e.S.F); int b = find(e.S.S); if(a != b){ un[a] = b; cc += e.F; --comp; if(cc >= ans || comp==0) break; } } if(cc >= ans || comp) continue; ans = cc; } cout << ans << endl; }else{ rep(S,1<