/***************************************************
 * Alex Palcuie
 * Romania - 2013
 * alex [dot] palcuie [at] gmail [dot] com
 * http://palcu.blogspot.com/
****************************************************/

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iterator>
#include <cstring>
#include <climits>

using namespace std;

// Defines
#define NAME(n) #n
#define pr(x) db((x), (#x))
#define prv(v,n) dbv((v), (#v), (n))
#define prw(v) dbw((v), (#v))
#define X first
#define Y second
#define pb push_back
typedef pair<int,int> pii;

// Helpers
template <typename T>
inline void db(const T x, const char * name){
	cerr << name << " = " << x << '\n';
}
template <typename T> inline void dbv(const T * v, const char * name, int n){
	fprintf(stderr, "=== %s ===\n", name);
	for(int i=0; i<n; i++)
		cerr << v[i] << " ";
	cerr << '\n';
}
template <typename T> inline void dbs(T x){
	cerr << x << ' ';
}

template<typename T>
void dbw(const std::vector<T>& t, const char * name){
	fprintf(stderr, "=== %s ===\n", name);
	unsigned n = t.size();
	for(typename std::vector<T>::size_type i=0; i<n; ++i)
		std::cerr << t[i] << ' ';
	cerr << '\n';
}

// Structs
struct Nod{
    int y, val;
    Nod(int a, int b){
        y=a; val=b;
    }
};

// Constants
const int N = 36008;
const int INF = 0x3f3f3f3f;

// Globals
int nAsezari, nDrumuri, nFortarete;
vector<int> fortarete;
vector<Nod> graph[N];
long long d[N];
int sol[N];
bool isInQueue[N];

// Functions
int main(){
	#ifndef ONLINE_JUDGE
	freopen("catun.in","r",stdin);
	freopen("catun.out","w",stdout);
	#endif

	int i, x, a, b, fort;
	priority_queue<pii> pq;
	scanf("%d%d%d", &nAsezari, &nDrumuri, &nFortarete);

	for(i=1; i<=nAsezari; i++){
	    sol[i] = i;
	    d[i] = INF;
	}

	for(i=0; i<nFortarete; i++){
        scanf("%d", &fort);
        pq.push(make_pair(0,fort));
        d[fort] = 0;
        sol[fort] = fort;
	}

	for(i=0; i<nDrumuri; i++){
        scanf("%d%d%d", &a, &b, &x);
        graph[a].pb(Nod(b, x));
        graph[b].pb(Nod(a, x));
	}

    while(!pq.empty()){
        int nod = pq.top().second;
        int val = d[nod];
        pq.pop(); isInQueue[nod]=0;

        for(i=0; i<graph[nod].size(); i++){
            Nod target = graph[nod][i];
            if(d[target.y] > val + target.val){
                d[target.y] = val + target.val;
                sol[target.y] = sol[nod];
                pq.push(make_pair(d[target.y], target.y));
            }
            else if(d[target.y] == val + target.val)
                sol[target.y] = min(sol[target.y], sol[nod]);
        }
    }
    for(i=1; i<=nAsezari; i++)
        printf("%d ", sol[i] == i ? 0 : sol[i]);
    printf("\n");


	return 0;
}