#include <bits/stdc++.h>
using namespace std;
int main() {
	#define int long long
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> col(n);
	for (int i = 0; i < n; i++) {
		cin >> col[i];
		col[i]--;
	}
	vector<vector<array<int, 2>>> e(n);
	for (int i = 0, u, v; i < m; i++) {
		cin >> u >> v;
		u--;
		v--;
		e[u].push_back({v, (col[v] - col[u] - 1 + k * 2) % k});
		e[v].push_back({u, (col[u] - col[v] - 1 + k * 2) % k});
	}
	vector<int> dis(n, 1e18), fixed(n);
	priority_queue<array<int, 2>, vector<array<int, 2>>, greater<>> Q;
	Q.push({dis[0] = 0, 0});
	while (!Q.empty()) {
		auto [d, u] = Q.top();
		Q.pop();
		if (fixed[u]) {
			continue;
		}
		fixed[u] = 1;
		for (auto [v, w] : e[u]) {
			if (dis[v] > dis[u] + w) {
				Q.push({dis[v] = dis[u] + w, v});
			}
		}
	}
	for (int i = 0; i < n; i++) {
		cout << (col[i] - dis[i] % k + k) % k + 1 << " \n"[i + 1 == n];
	}
	return 0;
}