#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<pair<int, int>> v[72005];
int fortnite[36005];
int d[72005], ans[72005];
set<pair<int, int>> s;
signed main()
{
    ifstream cin("catun.in");
    ofstream cout("catun.out");
    int n, m, k;
    cin >> n >> m >> k;
    for(int i = 1; i <= k; i++){
        cin >> fortnite[i];
    }
    for(int i = 1; i <= m; i++){
        int a, b, c;
        cin >> a >> b >> c;
        v[a].push_back({b, c});
        v[b].push_back({a, c});
    }
    for(int i = 1; i <= n; i++)
        d[i] = LONG_MAX;
    for(int i = 1; i <= k; i++){
        d[fortnite[i]] = 0;
        s.insert({0, fortnite[i]});
        ans[fortnite[i]] = fortnite[i];
    }
    while(!s.empty()){
        int nod = s.begin()->second;
        int boala = ans[nod];
        s.erase(s.begin());
        for(auto p : v[nod]){
            int to = p.first;
            int len = p.second;
            if(d[to] > d[nod] + len){
                ans[to] = boala;
                s.erase({d[to], to});
                d[to] = d[nod] + len;
                s.insert({d[to], to});
            }
        }
    }
    for(int i = 1; i <= k; i++)
        ans[fortnite[i]] = 0;
    for(int i = 1; i <= n; i++){
        cout << ans[i] << " ";
    }
    return 0;
}