#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;
int n,m,k;
const int N=5e5+100;
int f[N],c[N];
int g(int x){
    if(x==f[x]) return x;
    return f[x]=g(f[x]);
}
struct edg{
    int x,y;
}e[N];
vector<pair<int,int>>v[N];
// void dij(int )
using pa=pair<int,int>;
priority_queue<pa,vector<pa>,greater<pa>>q;
int vis[N],dis[N];
vector<int>meg[N];
int cur[N];
int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++) cin>>c[i],c[i]--;
    for(int i=1;i<=n;i++) f[i]=i;
    for(int i=1;i<=m;i++){
        cin>>e[i].x>>e[i].y;
        auto[a,b]=e[i];
        if(g(a)==g(b)) continue;
        if(abs(c[a]-c[b])==1)f[g(a)]=b;
    }
    for(int i=1;i<=m;i++){
        // if(g(e[i].x)!+)
        auto [a,b]=e[i];
        if(g(a)==g(b)) continue;
        v[g(a)].push_back(make_pair(g(b),(c[b]-c[a]-1+k)%k));
        v[g(b)].push_back(make_pair(g(a),(c[a]-c[b]-1+k)%k));
    }
    memset(dis,63,sizeof(dis));
    int u=g(1);
    dis[u]=0;q.push(make_pair(dis[u],u));
    while(!q.empty()){
        int x=q.top().second;q.pop();
        if(vis[x]) continue;
        vis[x]=1;
        for(auto [y,w]:v[x]){
            if(dis[y]>dis[x]+w){
                dis[y]=dis[x]+w;
                q.push(make_pair(dis[y],y));
            }
        }
    }
    // for(int i=1;i<=n;i++){
        // if(g(i)==i){
            // meg[dis[i]].push_back(i);
        // }
    // }
    cerr<<"?? "<<g(3)<<" "<<g(4)<<endl;
    for(int i=1;i<=n;i++){
        cur[i]=(c[i]+1000000-dis[g(i)])%k;
    }
    for(int i=1;i<=n;i++){
        cout<<cur[i]+1<<" ";
    }
}