#include <bits/stdc++.h>
const int MAXN = 300005;
using namespace std;
int n, m, k, R[MAXN], hi[MAXN], lo[MAXN], deg[MAXN], ans[MAXN];
vector<int> Gr[MAXN], G[MAXN];
void solve() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    cin >> R[i];
  }
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    Gr[v].push_back(u);
    G[u].push_back(v);
    deg[v]++;
  }
  queue<int> Q;
  for (int i = 1; i <= n; i++) {
    if (deg[i] == 0) {
      Q.push(i);
    }
  }
  int vis = 0;
  vector<int> ord;
  while (!Q.empty()) {
    int v = Q.front();
    Q.pop();
    vis++;
    ord.push_back(v);
    for (int to : G[v]) {
      deg[to]--;
      if (deg[to] == 0) {
        Q.push(to);
      }
    }
  }
  if (vis != n) {
    cout << "-1\n";
    return;
  }
  for (int i = n - 1; i >= 0; i--) {
    int v = ord[i];
    lo[v] = (R[v] == 0 ? 1 : R[v]);
    for (int to : G[v]) {
      lo[v] = max(lo[v], lo[to] + 1);
    }
  }
  for (int i = 0; i < n; i++) {
    int v = ord[i];
    hi[v] = (R[v] == 0 ? k : R[v]);
    for (int fr : Gr[v]) {
      hi[v] = min(hi[v], hi[fr] - 1);
    }
  }
  int ok = 1;
  vector<pair<int, int> > add;
  for (int i = 1; i <= n; i++) {
    if (hi[i] < lo[i] || lo[i] > k || hi[i] < 1) {
      ok = 0;
      break;
    }
    add.push_back(pair<int, int>(hi[i], i));
  }
  sort((add).begin(), (add).end());
  if (!ok) {
    cout << "-1\n";
    return;
  }
  set<pair<int, int> > P;
  for (int i = k; i >= 1; i--) {
    while (!add.empty() && add.back().first >= i) {
      int v = add.back().second;
      P.insert(pair<int, int>(lo[v], v));
      add.pop_back();
    }
    if (P.empty()) {
      ok = 0;
      break;
    }
    int cnt = 0;
    while (!P.empty() && (P.rbegin()->first == i || cnt == 0)) {
      pair<int, int> p = *P.rbegin();
      ans[p.second] = i;
      cnt++;
      P.erase(--P.end());
    }
  }
  if (!ok) {
    cout << "-1\n";
    return;
  }
  for (int i = 1; i <= n; i++) {
    for (int to : G[i]) {
      assert(ans[i] >= ans[to]);
    }
    if (R[i] != 0) {
      assert(ans[i] == R[i]);
    }
    cout << ans[i] << " \n"[i == n];
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int tc = 1;
  for (int i = 1; i <= tc; i++) {
    solve();
  }
  return 0;
}
