#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e6 + 10;
priority_queue<int> P;
priority_queue<int, vector<int>, greater<int> > mP;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int mod = 1000 * 1000 * 1000 + 7;
long long ksm(int a, int b) {
  if (b == 0) return 1LL;
  long long ret = 1, pp = a;
  while (b) {
    if (b % 2 == 1) {
      ret *= pp;
      ret %= mod;
    }
    b /= 2;
    pp = pp * pp % mod;
  }
  return ret;
}
int bit[maxN];
int lowbit(int x) { return x & (-x); }
void update(int i, int v) {
  while (i < maxN) {
    bit[i] += v;
    i += lowbit(i);
  }
}
int getsum(int i) {
  int x = 0;
  while (i > 0) {
    x += bit[i];
    i -= lowbit(i);
  }
  return x;
}
void change(int a, int b, int k) {
  update(a, k);
  update(b + 1, -k);
}
int father[maxN];
void init(int n) {
  for (int i = 1; i <= n; i++) father[i] = i;
  return;
}
int find(int v) {
  if (father[v] == v)
    return v;
  else
    return father[v] = find(father[v]);
}
void merge(int v, int u) {
  int t1 = find(v);
  int t2 = find(u);
  father[t2] = t1;
  return;
}
long long hashing(string s) {
  long long ans[2] = {1, 1};
  int p[2] = {402653189, 1610612741};
  for (int j = 0; j < 2; j++) {
    for (int i = 0; i < s.size(); i++) {
      ans[j] = ((ans[j] * 257) + s[i] - 'a') % p[j];
    }
  }
  return ans[0] * 2e10 + ans[1];
}
int a[maxN];
vector<int> edge[maxN];
vector<int> c[101];
int dist[100001][101];
int visit[100001];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int m, k, s;
  cin >> m >> k >> s;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    c[a[i]].push_back(i);
  }
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    edge[u].push_back(v);
    edge[v].push_back(u);
  }
  for (int i = 1; i <= k; i++) {
    queue<int> cq;
    memset(visit, 0, sizeof(visit));
    for (int j = 0; j < c[i].size(); j++) {
      cq.push(c[i][j]);
      visit[c[i][j]] = 1;
      dist[c[i][j]][i] = 0;
    }
    while (!cq.empty()) {
      int t = cq.front();
      cq.pop();
      for (int k = 0; k < edge[t].size(); k++) {
        int to = edge[t][k];
        if (!visit[to]) {
          dist[to][i] = dist[t][i] + 1;
          visit[to] = 1;
          cq.push(to);
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    sort(dist[i] + 1, dist[i] + k + 1);
    int sum = 0;
    for (int j = 1; j <= s; j++) sum += dist[i][j];
    cout << sum << " ";
  }
  cout << endl;
  return 0;
}
