#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m,k;
int a[500005];

int cnt;
int head[500005];
struct eg{
	int to,nxt,w;
}edge[1000005];

void make(int u,int v,int w){
	edge[++cnt].to = v;
	edge[cnt].w = w;
	edge[cnt].nxt = head[u];
	head[u] = cnt;
}

int calc(int x,int y){
	if(abs(x - y) == 1 || abs(x - y) == k - 1) return 0;
	y--;
	if(!y) y = k;
	if(y > x) return y - x;
	return k + y - x;
}

ll dis[500005];
priority_queue <pll> Q;
void dijsktra(){
	memset(dis,0x3f,sizeof(dis));
	dis[1] = 0;
	Q.push(mkp(0,1));
	while(!Q.empty()){
		pll cur = Q.top();
		Q.pop();
		if(-cur.first != dis[cur.second]) return;
		int u = cur.second;
		for(int i = head[u];i;i = edge[i].nxt){
			int v = edge[i].to;
			if(dis[v] > dis[u] + edge[i].w){
				dis[v] = dis[u] + edge[i].w;
				Q.push(mkp(-dis[v],v));
			}
		}
	}
}

int main(){
	scanf("%d%d%d",&n,&m,&k);
	rep(u,1,n) scanf("%d",&a[u]);
	rep(i,1,m){
		int u,v;
		scanf("%d%d",&u,&v);
		make(u,v,calc(a[u],a[v]));
		make(v,u,calc(a[v],a[u]));
	}
	dijsktra();
	ll ovo;
	rep(u,1,n){
		ovo = a[u] - dis[u];
		ovo %= k;
		if(ovo <= 0) ovo += k;
		printf("%lld ",ovo);
	}
	printf("\n");
	return 0;
}