#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000001;
int n,m,k,b[N];
bool h[N];
ll f[N];
vector<int> a[N];
int main()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;++i)
    {
        scanf("%d",&b[i]);
        --b[i];
    }
    for(int i=1;i<=m;++i)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        a[x].push_back(y);
        a[y].push_back(x);
    }
    queue<int> Q;
    for(int i=1;i<=n;++i) f[i]=1e18,h[i]=false;
    f[1]=0,h[1]=true;
    Q.push(1);
    while(!Q.empty())
    {
        int x=Q.front();
        Q.pop();
        if(h[x]==false) continue;
        h[x]=false;
        for(auto i:a[x])
        {
            if(f[x]+((b[i]-b[x]-1)%k+k)%k<f[i])
            {
                f[i]=f[x]+((b[i]-b[x]-1)%k+k)%k;
                h[i]=true;
                Q.push(i);
            }
        }
    }
    for(int i=1;i<=n;++i)
    {
        printf("%lld ",(((ll)1e18-f[i]+b[i])%k+k)%k+1);
    }
    return 0;
}