#include <bits/stdc++.h>
using namespace std;
struct Graph {
  vector<vector<int> > adj;
  vector<vector<int> > radj;
  vector<int> FV;
  vector<int> UP, LO;
  Graph(int N) : adj(N), radj(N), FV(N, -1), UP(N, -1), LO(N, -1) {}
  void addEdge(int u, int v) {
    adj[u].push_back(v);
    radj[v].push_back(u);
  }
  bool build(int K) {
    vector<int> VIS(adj.size());
    for (int i = 0; i < adj.size(); ++i) {
      if (!VIS[i] && hasCycle(i, VIS)) return false;
    }
    for (int i = 0; i < adj.size(); ++i)
      if (UP[i] == -1 && !buildUpper(i, K)) return false;
    for (int i = 0; i < adj.size(); ++i)
      if (LO[i] == -1 && !buildLower(i, K)) return false;
    return true;
  }
  bool hasCycle(int u, vector<int> &VIS) {
    if (VIS[u] == 2) return false;
    if (VIS[u] == 1) return true;
    VIS[u] = 1;
    for (int v : adj[u]) {
      if (hasCycle(v, VIS)) return true;
    }
    VIS[u] = 2;
    return false;
  }
  bool buildUpper(int u, int K) {
    int lowest = FV[u] == -1 ? K : FV[u];
    for (int v : adj[u]) {
      if (UP[v] == -1) {
        if (!buildUpper(v, K)) return false;
      }
      lowest = min(UP[v] - 1, lowest);
    }
    if (FV[u] != -1 && FV[u] > lowest) {
      return false;
    }
    UP[u] = lowest;
    return true;
  }
  bool buildLower(int u, int K) {
    int biggest = FV[u] == -1 ? 1 : FV[u];
    for (int v : radj[u]) {
      if (LO[v] == -1) {
        if (!buildLower(v, K)) return false;
      }
      biggest = max(biggest, LO[v] + 1);
    }
    if (FV[u] != -1 && FV[u] < biggest) {
      return false;
    }
    LO[u] = biggest;
    return true;
  }
};
struct Range {
  int s, e, id;
};
bool byEnd(Range a, Range b) { return a.e < b.e; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N, M, K;
  cin >> N >> M >> K;
  Graph G(N);
  for (int i = 0; i < N; ++i) {
    int n;
    cin >> n;
    if (n == 0) continue;
    G.FV[i] = K - n + 1;
  }
  for (int i = 0; i < M; ++i) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    G.addEdge(u, v);
  }
  if (!G.build(K)) {
    cout << -1 << '\n';
    return 0;
  }
  vector<Range> R;
  for (int i = 0; i < N; ++i) {
    R.push_back({G.LO[i], G.UP[i], i});
    if (G.LO[i] > G.UP[i]) {
      cout << -1 << '\n';
      return 0;
    }
  }
  set<int> S;
  for (int i = 1; i <= K; ++i) {
    S.insert(i);
  }
  sort(R.begin(), R.end(), byEnd);
  vector<int> ANS(N);
  for (int i = 0; i < R.size(); ++i) {
    auto l = S.lower_bound(R[i].s);
    if (l == S.end() || *l > R[i].e) {
      ANS[R[i].id] = R[i].e;
    } else {
      ANS[R[i].id] = *l;
      S.erase(*l);
    }
  }
  if (S.size()) {
    cout << -1 << '\n';
    return 0;
  }
  for (int v : ANS) {
    cout << K - v + 1 << " ";
  }
  cout << '\n';
  return 0;
}
