#include <bits/stdc++.h>
int min(int a, int b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
int ii[300000], jj[300000], ww[300000];
int *oh[300000], oo[300000];
void link(int i, int h) {
  int o = oo[i]++;
  if (o >= 2 && (o & o - 1) == 0)
    oh[i] = (int *)realloc(oh[i], o * 2 * sizeof *oh[i]);
  oh[i][o] = h;
}
int ds[300000];
long long cc[300000];
int kk[300000];
int find(int i) { return ds[i] < 0 ? i : (ds[i] = find(ds[i])); }
void join(int i, int j) {
  i = find(i);
  j = find(j);
  if (i == j) return;
  if (ds[i] > ds[j]) {
    ds[i] = j;
    cc[j] += cc[i], kk[j] += kk[i];
  } else {
    if (ds[i] == ds[j]) ds[i]--;
    ds[j] = i;
    cc[i] += cc[j], kk[i] += kk[j];
  }
}
int ta[300000], tb[300000];
void dfs0(int p, int i) {
  static int time;
  int o;
  ta[i] = tb[i] = ++time;
  for (o = 0; o < oo[i]; o++) {
    int h = oh[i][o], j = i ^ ii[h] ^ jj[h];
    if (j != p) {
      if (!ta[j]) {
        dfs0(i, j);
        tb[i] = min(tb[i], tb[j]);
      } else
        tb[i] = min(tb[i], ta[j]);
    }
  }
  if (ta[i] > tb[i]) join(p, i);
}
long long dp[300000], dq[300000];
int k;
void dfs1(int p, int i) {
  int o;
  long long x;
  x = cc[i];
  for (o = 0; o < oo[i]; o++) {
    int h = oh[i][o], j = i ^ ii[h] ^ jj[h];
    if (j != p) {
      dfs1(i, j);
      x += kk[j] == 0 || kk[j] == k ? dp[j] : max(dp[j] - ww[h], 0);
      kk[i] += kk[j];
    }
  }
  dp[i] = x;
}
void dfs2(int f, int i, long long x, int c) {
  int o;
  dq[i] = x = c == 0 || c == k ? x : max(x - ww[f], 0);
  for (o = 0; o < oo[i]; o++) {
    int h = oh[i][o], j = i ^ ii[h] ^ jj[h];
    if (h != f)
      dfs2(h, j,
           x + dp[i] -
               (kk[j] == 0 || kk[j] == k ? dp[j] : max(dp[j] - ww[h], 0)),
           c + kk[i] - kk[j]);
  }
}
int main() {
  int n, m, h, i, j;
  scanf("%d%d%d", &n, &m, &k);
  for (i = 0; i < n; i++) oh[i] = (int *)malloc(2 * sizeof *oh[i]);
  for (h = 0; h < k; h++) {
    scanf("%d", &i), i--;
    kk[i] = 1;
  }
  for (i = 0; i < n; i++) scanf("%lld", &cc[i]);
  for (h = 0; h < m; h++) scanf("%d", &ww[h]);
  for (h = 0; h < m; h++) {
    scanf("%d%d", &i, &j), i--, j--;
    ii[h] = i, jj[h] = j;
    link(i, h), link(j, h);
  }
  memset(ds, -1, n * sizeof *ds);
  dfs0(-1, 0);
  for (i = 0; i < n; i++) {
    free(oh[i]);
    oh[i] = (int *)malloc(2 * sizeof *oh[i]), oo[i] = 0;
  }
  for (h = 0; h < m; h++) {
    i = ii[h] = find(ii[h]), j = jj[h] = find(jj[h]);
    if (i != j) link(i, h), link(j, h);
  }
  dfs1(-1, find(0));
  dfs2(-1, find(0), 0, 0);
  for (i = 0; i < n; i++) {
    int i_ = find(i);
    printf("%lld ", dp[i_] + dq[i_]);
  }
  printf("\n");
  return 0;
}
