#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline ll read(){
	ll x(0),f(0); char ch=getchar();
	while(ch<'0'||ch>'9') f|=ch=='-',ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}

const int N=2e6+10;
int n,m,k,c[N],u[N],v[N],head[N],cnt; ll dis[N]; vector<int> G[N];
struct edge{
    int to,nxt,w;
}e[N];
inline void add(int u,int v,int w){
    e[++cnt].to=v,e[cnt].nxt=head[u],e[cnt].w=w,head[u]=cnt;
    e[++cnt].to=u,e[cnt].nxt=head[v],e[cnt].w=w,head[v]=cnt;
}

inline int mod(int x){return (x%k+k)%k;}

struct node{
    int x,dis;
    node(int _x,int _dis):x(_x),dis(_dis){}
    friend bool operator < (node a,node b){return a.dis>b.dis;}
};

signed main(){
	n=read(),m=read(),k=read();
	for(int i=1;i<=n;++i) c[i]=read()-1;
	for(int i=1;i<=m;++i){
        u[i]=read(),v[i]=read();
        add(u[i],v[i],min(mod(c[v[i]]+1-c[u[i]]),mod(c[v[i]]-1-c[u[i]])));
        add(v[i],u[i],min(mod(c[u[i]]+1-c[v[i]]),mod(c[u[i]]-1-c[v[i]])));
    }
    memset(dis,0x3f,sizeof dis);
    priority_queue<node> q; q.emplace(1,0),dis[1]=0;
    while(!q.empty()){
        int u=q.top().x; q.pop();
        for(int i=head[u];i;i=e[i].nxt){
            int v=e[i].to;
            if(dis[u]+e[i].w<dis[v]) dis[v]=dis[u]+e[i].w,q.emplace(v,dis[v]);
        }
    }
    for(int i=1;i<=n;++i) c[i]=(c[i]+dis[0]-dis[i])%k,printf("%d ",c[i]+1);
	return 0;
}