#include <bits/stdc++.h>
using namespace std;
constexpr int kN = int(3E5 + 10);
bool used_edge[kN], in[kN], went[kN], need[kN];
int dep[kN], h[kN], t, p[kN], v[kN], c[kN], w[kN], d[kN];
long long int val[kN], ans[kN], dp[kN];
stack<int> s;
vector<pair<int, int>> graph[kN], ng[kN];
int Find(int n) { return n == p[n] ? n : p[n] = Find(p[n]); }
void tarjan(int pos);
void dfs(int pos, int from);
void dfs_all(int pos, int from);
int main() {
  int n, m, k, l, r, nxt;
  queue<int> q;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= k; i++) scanf("%d", &v[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
  for (int i = 1; i <= m; i++) scanf("%d", &w[i]);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &l, &r);
    graph[l].push_back({r, i});
    graph[r].push_back({l, i});
  }
  for (int i = 1; i <= n; i++)
    if (!went[i]) tarjan(i);
  for (int i = 1; i <= k; i++) need[p[v[i]]] = true;
  for (int i = 1; i <= n; i++) val[p[i]] += c[i];
  for (int i = 1; i <= n; i++)
    for (pair<int, int> j : graph[i])
      if (p[j.first] != p[i]) ng[p[i]].push_back({p[j.first], w[j.second]});
  for (int i = 1; i <= n; i++) d[i] = int(ng[i].size());
  for (int i = 1; i <= n; i++)
    if (d[i] == 1 && !need[i]) q.push(i);
  while (!q.empty()) {
    nxt = q.front();
    q.pop();
    for (pair<int, int> i : ng[nxt])
      if (d[i.first] != 0) {
        d[i.first]--;
        p[Find(nxt)] = Find(i.first);
        val[i.first] += val[nxt];
        if (d[i.first] == 1 && !need[i.first]) q.push(i.first);
      }
  }
  for (int i = 1; i <= n; i++) graph[i].clear();
  for (int i = 1; i <= n; i++)
    for (pair<int, int> j : ng[i])
      if (Find(i) != Find(j.first))
        graph[Find(i)].push_back({Find(j.first), j.second});
  dfs(Find(1), Find(1));
  ans[Find(1)] = dp[Find(1)];
  dfs_all(Find(1), Find(1));
  printf("%lld", ans[Find(1)]);
  for (int i = 2; i <= n; i++) printf(" %lld", ans[Find(i)]);
  printf("\n");
}
void dfs(int pos, int from) {
  for (pair<int, int> i : graph[pos])
    if (i.first != from) dfs(i.first, pos);
  dp[pos] = val[pos];
  for (pair<int, int> i : graph[pos])
    if (i.first != from && dp[i.first] >= i.second)
      dp[pos] += dp[i.first] - i.second;
  return;
}
void dfs_all(int pos, int from) {
  if (from != pos) {
    dp[pos] = val[pos];
    for (pair<int, int> i : graph[pos])
      if (dp[i.first] >= i.second) dp[pos] += dp[i.first] - i.second;
    ans[pos] = dp[pos];
  }
  long long int tmp;
  for (pair<int, int> i : graph[pos])
    if (i.first != from) {
      if (dp[i.first] >= i.second)
        tmp = dp[i.first] - i.second;
      else
        tmp = 0;
      dp[pos] -= tmp;
      dfs_all(i.first, pos);
      dp[pos] += tmp;
    }
  return;
}
void tarjan(int pos) {
  s.push(pos);
  went[pos] = in[pos] = true;
  dep[pos] = h[pos] = ++t;
  for (pair<int, int> i : graph[pos])
    if (!used_edge[i.second]) {
      used_edge[i.second] = true;
      if (!went[i.first]) tarjan(i.first);
      if (in[i.first]) h[pos] = min(h[pos], h[i.first]);
    }
  if (dep[pos] == h[pos]) {
    while (s.top() != pos) {
      p[s.top()] = pos;
      in[s.top()] = false;
      s.pop();
    }
    p[pos] = pos;
    in[pos] = false;
    s.pop();
  }
  return;
}
