#include <bits/stdc++.h>
using namespace std;
ifstream f("catun.in");
ofstream g("catun.out");
//#define cout g
//ofstream g("catun.out");
const int NMAX=72001, INF=1e6;
bitset <NMAX> viz;

int main()
{
    int n, m, k;
    f >> n >> m >> k;
    vector<vector<pair<int, int>>> v(n+1, vector<pair<int, int>>());
    priority_queue<tuple<int,int,int>> pq;
    vector<int> fort(n+1, 0);
    vector<int> d(n+1, INF);
    vector<int> fortlist;
    for(int i=1; i<=k; i++)
    {
        int ft;
        f >> ft;
        d[ft]=0;
        fort[ft]=ft;
        pq.push(make_tuple(0,-ft,ft));
    }

    for(int i=1; i<=m; i++)
    {
        int x,y,c;
        f >> x >> y >> c;
        v[x].push_back({y,c});
        v[y].push_back({x,c});
    }
    //in priority queue, pe prima pozitie e distanta, a doua fortareata, a treia nodul din care plecam
    while(!pq.empty())
    {
        auto top = pq.top();
        int curent = get<2>(top);
        int dist = -get<0>(top);
        int ft = -get<1>(top);
        pq.pop();
        if(!viz[curent])
        {
            for(auto& vecin:v[curent])
            {
                if(d[vecin.first]>d[curent]+vecin.second)
                {
                    d[vecin.first]=d[curent]+vecin.second;
                    fort[vecin.first]=ft;
                    pq.push(make_tuple(-d[vecin.first],-ft,vecin.first));
                }else if(d[curent]+vecin.second==d[vecin.first] && ft < fort[vecin.first])
                {
                    fort[vecin.first]=ft;
                    pq.push({-(d[curent]+vecin.second),-ft,vecin.first});
                }
            }
            viz[curent]=1;
        }
    }
    for(int i=1; i<=n; i++)
    {
        if(d[i]==0)
            fort[i]=0;
    }

    for(int i=1; i<=n; i++)
        cout << fort[i] << " ";

}