#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<int, int> > h;
vector<int> g[200010], w[200010], s[200010];
int q[200010], d[200010], ans[200010], a[200010], v[200010], mi[200010], n, m,
    k, f, r;
void work(int x) {
  for (int j = 0; j < w[x].size(); j++) {
    int y = w[x][j];
    --d[y];
    if (d[y] == 0 && !ans[y]) h.push(make_pair(mi[y], y));
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    ans[i] = a[i];
    s[a[i]].push_back(i);
    v[a[i]] = 1;
  }
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    g[y].push_back(x);
    w[x].push_back(y);
    d[x]++;
  }
  f = 1, r = 0;
  for (int i = 1; i <= n; i++)
    if (!d[i]) {
      q[++r] = i;
      mi[i] = 1;
    }
  while (f <= r) {
    int x = q[f++];
    if (a[x]) {
      if (a[x] < mi[x]) {
        puts("-1");
        return 0;
      } else
        mi[x] = a[x];
    }
    for (int i = 0; i < g[x].size(); i++) {
      int y = g[x][i];
      mi[y] = max(mi[y], mi[x] + 1);
      if (--d[y] == 0) q[++r] = y;
    }
  }
  for (int i = 1; i <= n; i++) d[i] = g[i].size();
  for (int i = 1; i <= n; i++)
    if (!d[i] && !ans[i]) {
      h.push(make_pair(mi[i], i));
    }
  for (int i = k; i >= 1; i--) {
    for (int j = 0; j < s[i].size(); j++) work(s[i][j]);
    while (!h.empty()) {
      int x = h.top().second;
      if (mi[x] > i) {
        puts("-1");
        return 0;
      }
      if (mi[x] == i) {
        ans[x] = i;
        v[i] = 1;
        work(x);
        h.pop();
      } else
        break;
    }
    if (!v[i]) {
      if (!h.empty()) {
        int x = h.top().second;
        ans[x] = i;
        work(x);
        h.pop();
      } else {
        puts("-1");
        return 0;
      }
    }
  }
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < g[i].size(); j++)
      if (ans[i] >= ans[g[i][j]]) {
        puts("-1");
        return 0;
      }
  for (int i = 1; i <= n; i++) {
    printf("%d", ans[i]);
    if (i != n)
      printf(" ");
    else
      puts("");
  }
}
