#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using i128 = __int128_t;
using uint = unsigned;
using ull = unsigned long long;
using u128 = __uint128_t;
using pii = pair<int, int>;

int sz(auto&& x) { return int(size(x)); }

const auto& range = views::iota;

// End template

struct PQ_Item {
    int u;
    ll d;

    friend bool operator<(PQ_Item lhs, PQ_Item rhs) {
        return lhs.d > rhs.d;
    }
};

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a(n);
    for (auto& x : a) {
        cin >> x;
        x--;
    }
    vector<vector<int>> adj(n);
    while (m--) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    vector dist(n, LLONG_MAX);
    priority_queue<PQ_Item> pq;
    dist[0] = 0;
    pq.emplace(0, 0);
    while (!empty(pq)) {
        auto [u, d] = pq.top();
        pq.pop();

        for (auto v : adj[u]) {
            auto nd = d + (a[u] - a[v] - 1 + k) % k;
            if (nd < dist[v]) {
                dist[v] = nd;
                pq.emplace(v, nd);
            }
        }
    }

    for (auto u : range(0, n)) {
        auto ans = (a[u] + dist[u]) % k;
        cout << ans + 1 << " \n"[u == n - 1];
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    solve();
}