#include<cstdio>
#include<cctype>
#include<vector>

#define maxn 505505

template<class T>

inline T read(){
	T r=0,f=0;
	char c;
	while(!isdigit(c=getchar()))f|=(c=='-');
	while(isdigit(c))r=(r*10)+(c^48),c=getchar();
	return f?-r:r;
}

int n,m,K,col[maxn];

std::vector<int> vec[maxn],to[maxn];

int f[maxn];

bool vis[maxn];

int find(int x){
	return x^f[x]?f[x]=find(f[x]):x;
}

inline bool solve(){
	for(int i=1;i<=n;i++){
		f[i]=i,vis[i]=0;
		std::vector<int>().swap(vec[i]);
	}
	for(int u=1;u<=n;u++)
		for(auto v:to[u])
			if((col[u]+1)%K==col[v]||
			   (col[v]+1)%K==col[u])f[find(v)]=find(u);
	for(int i=1;i<=n;i++)
		vec[find(i)].push_back(i);
	if((int)vec[find(1)].size()==n)return false;
	for(int i=1;i<=n;i++){
		if(f[i]!=i||vis[i])continue;
		int pos=0,Min=1e9,d;
		for(auto u:vec[i])
			for(auto v:to[u]){
				if(find(v)==i)continue;
				d=((col[v]-1-col[u])%K+K)%K;
				if(d<Min)Min=d,pos=f[v];
			}
		vis[pos]=1,f[i]=pos;
		for(auto u:vec[i])
			(col[u]+=Min)%=K;
	}
	int tot=0;
	for(int i=1;i<=n;i++)
		tot+=(f[i]==i);
	return tot>1;
}

int main(){
	n=read<int>();
	m=read<int>();
	K=read<int>();
	for(int i=1;i<=n;i++)
		vec[col[i]=read<int>()-1].push_back(i);
	for(int i=1;i<=m;i++){
		int u=read<int>();
		int v=read<int>();
		to[u].push_back(v);
		to[v].push_back(u);
	}
	while(solve());
	for(int i=1;i<=n;i++)
		printf("%d ",col[i]+1);
	return 0;
}