#include <cstdio>
#include <cassert>
#include <vector>
#include <queue>
#define let const auto
#define rep(name,beg,end) for(decltype(beg + end) name = beg,name##_end = end;name <= name##_end;name++)
#define per(name,beg,end) for(decltype(beg + end) name = beg,name##_end = end;name >= name##_end;name--)
#define repn(lim) for(decltype(lim + 0) NOW = 1,LIM = lim;NOW <= LIM;NOW++)
#define debug(...) std::fprintf(stderr,__VA_ARGS__)
using ci = const int;
using ll = long long;
using Vec = std::vector<int>;
using Pir = std::pair<ll,int>;
using Heap = std::priority_queue<Pir,std::vector<Pir>,std::greater<Pir>>;

constexpr int maxn = 5e5 + 100;

int n,m,k,col[maxn];
Vec G[maxn];

ll delta;
Heap q;
bool vis[maxn];
void ins(ci u){
    vis[u] = 1;
    for(let v : G[u])
        if(!vis[v]){
            q.push({(col[v] - 1 - col[u] + 2 * k) % k + delta,v});
        }
    col[u] = (col[u] - delta % k + k) % k;
}
int main(){
    std::scanf("%d %d %d",&n,&m,&k);
    rep(i,1,n)std::scanf("%d",col + i),col[i]--;
    repn(m){
        int x,y; std::scanf("%d %d",&x,&y);
        G[x].push_back(y);
        G[y].push_back(x);
    }
    ins(1);
    while(!q.empty()){
        let [d,u] = q.top(); q.pop();
        if(vis[u])continue;
        let tmp = d - delta;
        delta += tmp;
        ins(u);
    }
    rep(i,1,n)std::printf("%lld ",(col[i] + delta) % k + 1);
    return 0;
}