#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int num = 0;
  char c = getchar();
  if (c == '-') return -read();
  while (c >= '0' && c <= '9') {
    num = (num << 3) + (num << 1) + c - '0';
    c = getchar();
  }
  return num;
}
inline long long READ() {
  long long num = 0;
  char c = getchar();
  if (c == '-') return -READ();
  while (c >= '0' && c <= '9') {
    num = (num << 3) + (num << 1) + c - '0';
    c = getchar();
  }
  return num;
}
int l[200007], r[200007];
int deg[200007];
int tps[200007], tppppppppppfxxk;
vector<int> nei[200007], fnei[200007];
bool lgl[200007], lgl2[200007];
vector<int> dsf;
set<pair<int, int> > ugl;
int n, m, k;
int rr[200007];
set<int> cnu;
int n1[200007];
int chs[200007];
queue<int> q;
priority_queue<pair<pair<int, int>, int> > qb;
pair<pair<int, int>, int> bb[200007];
bool FxxK(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  return a.first.second < b.first.second;
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++) scanf("%d", rr + i);
  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    if (!ugl.count(make_pair(a, b))) {
      nei[a].push_back(b);
      fnei[b].push_back(a);
    }
    deg[b]++;
  }
  for (int i = 1; i <= n; i++)
    if (!deg[i]) q.push(i);
  if (!((int)(q).size())) return printf("-1"), 0;
  while (((int)(q).size())) {
    int x = q.front();
    tps[x] = ++tppppppppppfxxk;
    dsf.push_back(x);
    q.pop();
    for (int i = 0; i < ((int)(nei[x]).size()); i++)
      if (!tps[nei[x][i]]) {
        deg[nei[x][i]]--;
        if (!deg[nei[x][i]]) q.push(nei[x][i]);
      }
  }
  if (tppppppppppfxxk < n) return printf("-1"), 0;
  for (int ii = n - 1; ii >= 0; ii--) {
    int i = dsf[ii];
    int maxv = 0;
    for (int j = 0; j < ((int)(nei[i]).size()); j++)
      maxv = max(maxv, l[nei[i][j]]);
    if (rr[i]) {
      if (rr[i] <= maxv) return printf("-1\n"), 0;
      l[i] = rr[i];
    } else
      l[i] = maxv + 1;
  }
  for (int ii = 0; ii < n; ii++) {
    int i = dsf[ii];
    int maxv = k + 1;
    for (int j = 0; j < ((int)(fnei[i]).size()); j++)
      maxv = min(maxv, r[fnei[i][j]]);
    if (rr[i]) {
      if (rr[i] >= maxv) return printf("-1\n"), 0;
      r[i] = rr[i];
    } else
      r[i] = maxv - 1;
  }
  for (int i = 1; i <= n; i++) bb[i] = (make_pair(make_pair(-r[i], l[i]), i));
  sort(bb + 1, bb + n + 1, FxxK);
  int cur = 1;
  for (int i = 1; i <= k; i++) {
    while (cur <= n && bb[cur].first.second == i) {
      qb.push(bb[cur]);
      cur++;
    }
    if (!((int)(qb).size())) return printf("-1\n"), 0;
    bool deled = 0;
    while (((int)(qb).size()) && qb.top().first.first == -i) {
      chs[qb.top().second] = i;
      qb.pop();
      deled = 1;
    }
    if (!deled) {
      if (!((int)(qb).size())) return printf("-1\n"), 0;
      chs[qb.top().second] = i;
      qb.pop();
    }
  }
  for (int i = 1; i <= n; i++)
    if (!chs[i]) return printf("-1"), 0;
  for (int i = 1; i <= n; i++) printf("%d%c", chs[i], i == n ? '\n' : ' ');
  return 0;
}
