#include<bits/stdc++.h> using namespace std; #define int long long vector<vector<pair<int , int>>> g; vector<int> dist , vis; void dfs(int u = 1 , int a = LLONG_MAX / 4){ dist[u] = max(dist[u] , a); vis[u] = 1; for(auto v : g[u]){ if(!vis[v.first]){ dfs(v.first , min(a , v.second)); } } } signed main(){ int n , m , q; cin>>n>>m>>q; dist.resize(n+1 ,0); vis.resize(n+1); g.resize(n+1); for(int i = 0 ;i < m ; i++){ int u , v, c; cin>>u>>v>>c; g[u].push_back({v , c}); g[v].push_back({u , c}); } dfs(); while(q--){ int u; cin>>u; cout<<dist[u]<<"\n"; } }