#include <bits/stdc++.h>
using namespace std;
long long int dx[] = {1, -1, 0, 0};
long long int dy[] = {0, 0, -1, 1};
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int power_mod(long long int a, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1)
      res = ((res % 1000000007) * (a % 1000000007)) % 1000000007, n--;
    else
      a = ((a % 1000000007) * (a % 1000000007)) % 1000000007, n /= 2;
  }
  return res;
}
long long int nCr(long long int n, long long int r) {
  if (r > n) return 0;
  double res = 1;
  for (long long int i = 1; i <= r; i++) res = (res * (n - r + i)) / i;
  return (long long int)(res + 0.01);
}
long long int power(long long int a, long long int n) {
  long long int res = 1;
  for (long long int i = 0; i < n; i++) res = res * a;
  return res;
}
bool cmp(pair<long long int, long long int> a,
         pair<long long int, long long int> b) {
  if (a.first < b.first)
    return true;
  else if (a.first == b.first)
    return a.second > b.second;
  else
    return false;
}
bool is_power_of_two(long long int n) {
  for (long long int i = 0; i < 32; i++) {
    if ((1 << i) == n) return true;
  }
  return false;
}
vector<long long int> ar[900005];
long long int col[900005];
long long int vis1[900005], vis2[900005];
vector<long long int> a[900005];
void solve() {
  long long int n, m;
  vector<long long int> ans;
  cin >> n >> m;
  for (long long int i = 0; i < m; i++) {
    long long int x, y;
    cin >> x >> y;
    ar[x].push_back(y);
    ar[y].push_back(x);
  }
  for (long long int i = 1; i < n + 1; i++)
    cin >> col[i], vis1[col[i]] = 1, a[col[i]].push_back(i);
  for (long long int i = 1; i < n + 1; i++) {
    if (vis1[i]) {
      for (long long int x : a[i]) {
        set<long long int> s;
        for (long long int y : ar[x]) {
          if (vis2[y]) {
            s.insert(col[y]);
          }
        }
        long long int p1 = 1, p2 = 1;
        for (long long int val : s) {
          if (val != p1) {
            break;
          }
          p1++;
        }
        p2 = p1;
        if (p2 == i) {
          ans.push_back(x);
          vis2[x] = 1;
        } else {
          cout << -1;
          return;
        }
      }
    }
  }
  for (long long int x : ans) cout << x << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    solve();
  }
}
