#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
long long n, m, k;
long long pre[maxn];
vector<long long> g[maxn], rg[maxn];
long long r[maxn];
long long dat[maxn][2];
bool prepro() {
  for (int i = 0; i < n; ++i) {
    if (r[i] == 0)
      dat[i][0] = dat[i][1] = -1;
    else
      dat[i][0] = dat[i][1] = r[i];
  }
  queue<int> q;
  for (int i = 0; i < n; ++i) {
    pre[i] = rg[i].size();
    if (pre[i] == 0) q.push(i);
  }
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    if (dat[u][0] == -1) {
      dat[u][0] = 1;
      for (int j = 0; j < rg[u].size(); ++j)
        dat[u][0] = max(dat[u][0], dat[rg[u][j]][0] + 1);
    }
    for (int i = 0; i < g[u].size(); ++i) {
      int v = g[u][i];
      --pre[v];
      if (pre[v] == 0) q.push(v);
    }
  }
  for (int i = 0; i < n; ++i) {
    pre[i] = g[i].size();
    if (pre[i] == 0) q.push(i);
  }
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    if (dat[u][1] == -1) {
      dat[u][1] = k;
      for (int j = 0; j < g[u].size(); ++j)
        dat[u][1] = min(dat[u][1], dat[g[u][j]][1] - 1);
    }
    for (int i = 0; i < rg[u].size(); ++i) {
      int v = rg[u][i];
      --pre[v];
      if (pre[v] == 0) q.push(v);
    }
  }
  for (int i = 0; i < n; ++i) {
    if (dat[i][0] == -1 or dat[i][1] == -1) return false;
    for (int j = 0; j < g[i].size(); ++j) {
      int v = g[i][j];
    }
  }
  return true;
}
bool solve() {
  priority_queue<pair<long long, long long> > q1, q2;
  for (int i = 0; i < n; ++i) {
    q1.push(pair<long long, long long>(-dat[i][0], i));
  }
  for (int i = 1; i <= k; ++i) {
    while (!q1.empty() and q1.top().first == -i) {
      pair<long long, long long> aux = q1.top();
      q1.pop();
      int j = aux.second;
      q2.push(pair<long long, long long>(-dat[j][1], j));
    }
    if (q2.empty()) return false;
    pair<long long, long long> aux = q2.top();
    q2.pop();
    r[aux.second] = i;
    while (!q2.empty() and q2.top().first == -i) {
      r[q2.top().second] = i;
      q2.pop();
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < g[i].size(); ++j) {
      int v = g[i][j];
      if (r[i] >= r[v]) return false;
    }
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> k;
  for (int i = 0; i < n; ++i) cin >> r[i];
  for (int i = 0; i < m; ++i) {
    int x, y;
    cin >> x >> y;
    --x;
    --y;
    rg[x].push_back(y);
    g[y].push_back(x);
  }
  if (!prepro()) {
    cout << "-1\n";
    return 0;
  }
  if (!solve()) {
    cout << "-1\n";
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    if (i) cout << ' ';
    cout << r[i];
  }
  cout << '\n';
}
