#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MOD2 = MOD + 2;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
int modulo(int a, int b) { return (a % b + b) % b; }
const int N = 500500;
vector<vector<long long> > adj(N);
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, m;
  cin >> n >> m;
  for (int i = (1); i <= (m); i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  vector<long long> t(n + 1);
  vector<vector<long long> > color(n + 1);
  for (int i = (1); i <= (n); i++) {
    cin >> t[i];
    if (t[i] > n) {
      cout << "-1\n";
      return 0;
    }
    color[t[i]].push_back(i);
  }
  for (int i = (1); i <= (n); i++) {
    for (auto v : adj[i]) {
      if (t[v] == t[i]) {
        cout << "-1\n";
        return 0;
      }
    }
  }
  for (int i = (1); i <= (n); i++) {
    if (t[i] == 1) continue;
    if (adj[i].size() < t[i] - 1) {
      cout << "-1\n";
      return 0;
    }
    vector<bool> present(t[i], false);
    for (auto v : adj[i]) {
      if (t[v] < t[i]) present[t[v]] = true;
    }
    for (int j = (1); j <= (t[i] - 1); j++) {
      if (!present[j]) {
        cout << "-1\n";
        return 0;
      }
    }
  }
  for (int i = (1); i <= (n); i++) {
    for (auto x : color[i]) {
      cout << x << " ";
    }
  }
  cout << "\n";
  return 0;
}
