#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = 1e5 + 6;
const double eps = 1e-6;
using namespace std;
bool eq(const double &a, const double &b) { return fabs(a - b) < eps; }
bool ls(const double &a, const double &b) { return a + eps < b; }
bool le(const double &a, const double &b) { return eq(a, b) || ls(a, b); }
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); };
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long kpow(long long a, long long b) {
  long long res = 1;
  if (b < 0) return 1;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a;
    a = a * a;
  }
  return res;
}
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, m, k, s;
int a[maxn];
int in[maxn] = {0};
int dis[maxn][110];
vector<int> G[maxn];
void bfs() {
  memset(dis, 0x3f, sizeof(dis));
  queue<int> q;
  for (int i = 1; i < (n + 1); ++i) q.push(i), dis[i][a[i]] = 0, in[i] = 1;
  while ((int)q.size()) {
    int u = q.front();
    q.pop();
    in[u] = 0;
    for (int i = 0; i < ((int)G[u].size()); ++i) {
      int v = G[u][i];
      for (int j = 1; j < (k + 1); ++j) {
        if (dis[v][j] > dis[u][j] + 1) {
          dis[v][j] = dis[u][j] + 1;
          if (!in[v]) q.push(v), in[v] = 1;
        }
      }
    }
  }
}
int main() {
  int u, v;
  scanf("%d%d%d%d", &n, &m, &k, &s);
  for (int i = 1; i < (n + 1); ++i) scanf("%d", &a[i]);
  for (int i = 0; i < (m); ++i)
    scanf("%d%d", &u, &v), G[u].push_back(v), G[v].push_back(u);
  bfs();
  for (int i = 1; i < (n + 1); ++i) {
    sort(dis[i] + 1, dis[i] + k + 1);
    int sum = 0;
    for (int j = 1; j < (s + 1); ++j) sum += dis[i][j];
    printf("%d%c", sum, " \n"[i == n]);
  }
  return 0;
}
