#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << "]";
}
template <typename A, typename B>
istream &operator>>(istream &cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
mt19937 rng(61378913);
void usaco(string filename) {
  freopen((filename + ".in").c_str(), "r", stdin);
  freopen((filename + ".out").c_str(), "w", stdout);
}
const long double pi = 3.14159265358979323846;
const long long mod = 1000000007;
long long n, m, k, q, l, r, x, y, z;
long long a[1000005];
long long b[1000005];
long long c[1000005];
string second, t;
long long ans = 0;
vector<int> edges[500005];
pair<long long, long long> v[500005];
void solve(int tc) {
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    edges[a].push_back(b);
    edges[b].push_back(a);
  };
  for (int ele = 0; ele < n; ele++) cin >> a[ele];
  ;
  for (long long i = 0; i < (n); ++i) v[i] = make_pair(--a[i], i);
  sort(v, v + n);
  for (long long i = 0; i < (n); ++i) {
    long long d = edges[i].size() + 2;
    long long b[d];
    memset(b, 0, sizeof(b));
    for (int j : edges[i]) {
      if (a[j] < d) {
        b[a[j]] = 1;
      }
    }
    bool first = 1;
    for (long long j = 0; j < (a[i]); ++j)
      if (!b[j]) first = 0;
    if (b[a[i]]) first = 0;
    if (!first) {
      cout << -1 << endl;
      return;
    }
  }
  for (long long i = 0; i < (n); ++i) cout << v[i].second + 1 << " ";
  cout << '\n';
}
int main() {
  { ios_base::sync_with_stdio(false); }
  {
    cin.tie(NULL);
    cout.tie(NULL);
  }
  int tc = 1;
  for (int t = 0; t < tc; t++) solve(t);
}
