#include<bits/stdc++.h> using namespace std; #define int long long vector<vector<pair<int , int>>> g; vector<int> dist , vis; signed main(){ int n , m , Q; cin>>n>>m>>Q; dist.resize(n+1 ,0); dist[1] = LLONG_MAX/4; 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}); } queue<int> q; q.push(1); while(!q.empty()){ int u = q.front(); q.pop(); if(vis[u])continue; vis[u] = 1; for(auto e : g[u]){ int v = e.first; int c= e.second; if(!vis[v]){ dist[v] = max(min(dist[u] , c) , dist[v]); q.push(v); } } } while(Q--){ int u; cin>>u; cout<<dist[u]<<"\n"; } }