//#pragma GCC optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Alllahuekber
//osmiyum
//23orz
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//dört böler altı artı iki ama ne böler altı ne böler iki
//Başarı, Boş Duranın Hakkı Değil... Koşturanın Hakkıdır. Hakan?
//Ne yapayım, elimden gelen bu :(
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define ins insert
#define mid ((start+end)/2)
#define FOR for(int i=0;i<n;i++)
#define see2(x,y) cin>>x>>y
#define see3(x,y,z) cin>>x>>y>>z
#define ll long long
#define invalid (start>end || start>r || end<l || r<l)
#define fi first
#define se second
#define _ <<" "<<
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pair<int,int>> piii;
const int INF=1e7;
const int nmax=1e5+1;
const int MOD=1e9+7;
const int big = 1e9;
void solve(){
int n,m,k,qq;
cin>>n>>m>>qq>>k;
vector<vector<int>> komsu(n+1,vector<int>());
vector<int> dist(n+1,-1);
queue<int> q;
vector<int> v(qq+1,0);
for(int i=1;i<=qq;i++)cin>>v[i];
for(int i=1;i<=m;i++){int x,y;cin>>x>>y;komsu[x].pb(y);komsu[y].pb(x);}
for(int i=1;i<=qq;i++){q.push(v[i]);dist[v[i]]=0;}
while(q.size()){
int node=q.front();q.pop();
for(auto go:komsu[node]){
if(~dist[go])continue;
dist[go]=dist[node]+1;
q.push(go);
}
}
for(int i=1;i<=n;i++){
int l=0,r=dist[i];
while(l<=r){
int md=(l+r)/2;
int val=k*md*(md+1)/2;
if(val<dist[i])l=md+1;
else r=md-1;
}
cout<<r+1<<" ";
}
cout<<endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
/* freopen("xxxxx.in", "r", stdin);
freopen("xxxxx.out", "w", stdout); */
int t=1;
/* cin>>t; */
while(t--){
solve();
}
return 0;
}
