#include <bits/stdc++.h>
using namespace std;
int pct(int x) { return __builtin_popcount(x); }
int pct(long long x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); }
int bt(long long x) { return 63 - __builtin_clzll(x); }
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
long long cdiv(long long a, long long b) {
  return a / b + !(a < 0 || a % b == 0);
}
int nxt_C(int x) {
  int c = x & -x, r = x + c;
  return (((r ^ x) >> 2) / c) | r;
}
long long nxt_C(long long x) {
  long long c = x & -x, r = x + c;
  return (((r ^ x) >> 2) / c) | r;
}
vector<int> get_bits(int mask) {
  vector<int> bb;
  while (mask) {
    int b = bt(mask);
    bb.push_back(b);
    mask ^= (1 << b);
  }
  reverse(bb.begin(), bb.end());
  return bb;
}
int get_mask(vector<int> v) {
  int mask = 0;
  for (int x : v) {
    mask ^= (1 << x);
  }
  return mask;
}
template <typename T>
void uniq(vector<T> &v) {
  sort(v.begin(), v.end());
  v.resize(unique(v.begin(), v.end()) - v.begin());
}
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
  uniform_int_distribution<long long> uid(l, r);
  return uid(rng);
}
void sc() {}
template <typename Head, typename... Tail>
void sc(Head &H, Tail &...T) {
  cin >> H;
  sc(T...);
}
const int mod = 1e9 + 7;
int pwr(int a, long long b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * 1LL * a) % mod;
    a = (a * 1LL * a) % mod;
    b >>= 1;
  }
  return ans;
}
const int N = 5e5 + 5;
vector<int> g[N];
vector<int> ans;
int t[N];
bool vis[N];
int val[N];
set<int> gg[N];
void solve() {
  int n, m;
  sc(n, m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    sc(u, v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  queue<int> q;
  for (int i = 1; i <= n; i++) {
    sc(t[i]);
    val[i] = 1;
    if (t[i] == val[i]) {
      q.push(i);
      vis[i] = 1;
    }
  }
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    while (gg[u].count(val[u])) val[u]++;
    if (val[u] != t[u]) {
      cout << -1;
      return;
    }
    ans.push_back(u);
    for (int v : g[u]) {
      gg[v].insert(t[u]);
      while (gg[v].count(val[v])) {
        val[v]++;
      }
      if (val[v] > t[v]) {
        cout << -1;
        return;
      }
      if (val[v] == t[v] && !vis[v]) {
        q.push(v);
        vis[v] = 1;
      }
    }
  }
  if ((int)ans.size() != n) {
    cout << -1;
    return;
  }
  for (int x : ans) {
    cout << x << " ";
  }
}
int main() {
  ios ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int tt = 1; tt <= t; tt++) {
    solve();
  }
  return 0;
}
