#include <bits/stdc++.h> #define int long long using namespace std; int n,m,k; int s[100005],g[100005],dis[100005]; bool bs[100005],b[100005],vis[100005]; int ans[100005]; vector <pair <int,int>> e[100005]; inline void dij () { priority_queue<pair <int,int>> q; for (int i = 1;i <= n;i++) { if (b[i]) { dis[i] = 1e18; vis[i] = 0; } else { dis[i] = 0; q.push(make_pair(0,i)); vis[i] = 1; } } while (!q.empty()) { int u = q.top().second; q.pop(); for (auto at : e[u]) { int v = at.first,w = at.second; if (b[v]) { ans[v] = min(ans[v],dis[u] + w); } if (dis[v] > dis[u] + w) { dis[v] = dis[u] + w; if (!vis[v]) { vis[v] = 1; q.push(make_pair(-dis[v],v)); } } } } return; } signed main () { cin >> n >> m >> k; for (int i = 1;i <= k;i++) { cin >> s[i]; bs[s[i]] = 1; } sort (s + 1,s + k + 1); for (int i = 1;i <= m;i++) { int u,v,w; cin >> u >> v >> w; e[v].push_back(make_pair(u,w)); } for (int i = 1;i <= n;i++) { sort(e[i].begin(),e[i].end()); } for (int i = 1;i <= n;i++) { ans[i] = 1e18; } for (int i = 0;i <= log2(n);i++) { for (int j = 1;j <= n;j++) { if (((1 << i) & j) && bs[j]) { b[j] = 0; } else { b[j] = 1; } } dij(); for (int j = 0;j <= n;j++) { if (!((1 << i) & j) && bs[j]) { b[j] = 0; } else { b[j] = 1; } } dij(); } for (int i = 1;i <= n;i++) { cin >> g[i]; } for (int i = 1;i <= n;i++) { cout << ans[i] * g[i] << ' '; } return 0; }