#include <bits/stdc++.h>
using namespace std;
long long int max(long long int a, long long int b) {
  if (a > b) {
    return a;
  }
  return b;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long int min(long long int a, long long int b) {
  if (a < b) {
    return a;
  }
  return b;
}
long long int power(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n % 2 == 1) {
      res = (res * x);
    }
    x = (x * x);
    n = n / 2;
  }
  return res;
}
long long int factorialNumInverse[1000001];
long long int naturalNumInverse[1000001];
long long int fact[1000001];
void InverseofNumber(long long int n, long long int p) {
  naturalNumInverse[0] = naturalNumInverse[1] = 1;
  for (long long int i = 2; i <= n; i++)
    naturalNumInverse[i] = naturalNumInverse[p % i] * (p - p / i) % p;
}
void InverseofFactorial(long long int n, long long int p) {
  factorialNumInverse[0] = factorialNumInverse[1] = 1;
  for (long long int i = 2; i <= n; i++)
    factorialNumInverse[i] =
        (naturalNumInverse[i] * factorialNumInverse[i - 1]) % p;
}
void factorial(long long int n, long long int p) {
  fact[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % p;
  }
}
long long int nCrModp(long long int n, long long int r, long long int p) {
  long long int ans =
      ((fact[n] * factorialNumInverse[r]) % p * factorialNumInverse[n - r]) % p;
  return ans;
}
vector<long long int> adj[1000005];
long long int visited[1000005];
long long int order[1000005];
long long int n, m;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  factorial(200005, 1000000007);
  InverseofNumber(200005, 1000000007);
  InverseofFactorial(200005, 1000000007);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    long long int u, v;
    cin >> u >> v;
    adj[v].push_back(u);
    adj[u].push_back(v);
  }
  vector<pair<long long int, long long int> > v;
  for (int i = 1; i <= n; i++) {
    cin >> order[i];
    v.push_back({order[i], i});
  }
  sort(v.begin(), v.end());
  memset(visited, 0, sizeof(visited));
  for (int i = 0; i < v.size(); i++) {
    long long int node = v[i].second;
    long long int cnt = 0;
    for (int j = 0; j < adj[node].size(); j++) {
      long long int val = adj[node][j];
      if (order[node] == order[val]) {
        cout << -1 << "\n";
        return 0;
      }
      if (order[val] < order[node]) {
        if (visited[order[val]] == 0) {
          visited[order[val]] = 1;
          cnt++;
        }
      }
    }
    if (cnt != v[i].first - 1) {
      cout << -1 << "\n";
      return 0;
    }
    for (int j = 0; j < adj[node].size(); j++) {
      visited[order[adj[node][j]]] = 0;
    }
  }
  for (int i = 0; i < v.size(); i++) {
    cout << v[i].second << " ";
  }
  return 0;
}
