1 #include<cstdio>
 2 #include<algorithm>
 3 #include<cstring>
 4 #include<cmath>
 5 #include<iostream>
 6 #include<cctype>
 7 #include<set>
 8 #include<vector>
 9 #include<queue>
10 #include<map>
11 #define fi(s) freopen(s,"r",stdin);
12 #define fo(s) freopen(s,"w",stdout);
13 using namespace std;
14 typedef long long LL;
15 
16 inline int read() {
17     int x=0,f=1;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch==‘-‘)f=-1;
18     for(;isdigit(ch);ch=getchar())x=x*10+ch-‘0‘;return x*f;
19 }
20 
21 const int N = 100005;
22 const int INF = 1e9;
23 
24 struct Edge{
25     int to, nxt;
26 }e[N << 1];
27 int head[N], En, dis[N][105], q[N];
28 vector<int> vec[105];
29 
30 void add_edge(int u,int v) {
31     ++En; e[En].to = v; e[En].nxt = head[u]; head[u] = En;
32     ++En; e[En].to = u; e[En].nxt = head[v]; head[v] = En;
33 }
34 
35 void bfs(int x) {
36     int L = 1, R = 0;
37     for (int sz = vec[x].size(), i = 0; i < sz; ++i) {
38         q[++R] = vec[x][i];
39         dis[vec[x][i]][x] = 0;
40     }
41     while (L <= R) {
42         int u = q[L++];
43         for (int i = head[u]; i; i = e[i].nxt) {
44             int v = e[i].to;
45             if (dis[v][x] == INF) {
46                 dis[v][x] = dis[u][x] + 1;
47                 q[++R] = v;
48             }
49         }
50     }
51 }
52 
53 int main() {
54     int n = read(), m = read(), k = read(), s = read();
55     for (int i = 1; i <= n; ++i) vec[read()].push_back(i);
56     for (int i = 1; i <= m; ++i) {
57         int u = read(), v = read();
58         add_edge(u, v);
59     }
60     for (int i = 1; i <= k; ++i) {
61         for (int j = 1; j <= n; ++j) dis[j][i] = INF;
62         bfs(i);
63     }
64     
65     for (int i = 1; i <= n; ++i) {
66         int ans = 0;
67         sort(dis[i] + 1, dis[i] + k + 1);
68         for (int j = 1; j <= s; ++j) ans += dis[i][j];
69         printf("%d ",ans);
70     }
71     
72     return 0;
73 }