#include <iostream>

#include <queue>

#include <list>

#include <algorithm>

#include <stdio.h>

#include <string.h>

using namespace std;

typedef long long ll;

#define MAX 2000000000 

int a[];

list <int> e[];

int d[][];

bool used[];

queue <int> q;

int main(){

//    fill(d[0],d[0]+500050*110,MAX);

    int n,m,k,s;

    scanf("%d%d%d%d", &n, &m, &k, &s);

    for(int i = ;i <= n; ++i){

        scanf("%d", &a[i]);

    }

    int u,v;

    for(int i = ;i <= m; ++i){

        scanf("%d%d", &u, &v);

        e[u].push_back(v);

        e[v].push_back(u);

    }

    for(int i = ;i <= k; ++i){

        memset(used,false,sizeof(used));

        for(int j = ;j <= n; ++j){

            if(a[j] == i){

                d[j][i] = ;

                q.push(j);

                used[j] = true;

            }

        }

        while(q.size()){

            int x = q.front();

            for(auto l:e[x]){

                if(!used[l]){

                    d[l][i] = d[x][i]+;

                    used[l] = true;

                    q.push(l);

                }

            }

            q.pop();

        }

    }

    for(int i = ;i <= n; ++i){

        sort(d[i]+,d[i]++k);

        int ans = ;

        for(int j = ;j <= s; ++j){

            ans += d[i][j];

        }

        printf("%d ",ans);

    }

    printf("\n");

    return ;

}