#include <bits/stdc++.h>
const long long int mod = 1000000007;
const long long int MOD1 = (int)1e9 + 9;
const long long int MOD2 = 998244353;
const long double pi = atan2(0, -1);
const long double eps = 1e-9;
const int N = 1e6 + 7;
const int MAXR = 1000005;
long long int tests = 1;
using namespace std;
long long int binarySearch(long long int l, long long int r, long long int k) {
  if (r >= l) {
    long long int mid = l + (r - l) / 2;
    if (mid * (mid + 1) == k) return 1;
    if (mid * (mid + 1) > k) return binarySearch(l, mid - 1, k);
    return binarySearch(mid + 1, r, k);
  }
  return 0;
}
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
void swap(long long int *p1, long long int *p2) {
  long long int temp = *p1;
  *p1 = *p2;
  *p2 = temp;
}
long long int cbratt(long long int x) {
  long long int l = 0, r = MAXR;
  while (l != r) {
    long long int m = (l + r + 1) / 2;
    if (m * m * m > x)
      r = m - 1;
    else
      l = m;
  }
  return l;
}
int MaxSubArraySumReturn(int a[], int n) {
  int sum = 0, best = 0;
  for (long long int i = 0; i < n; i++) {
    sum = max(a[i], a[i] + sum);
    best = max(best, sum);
  }
  return best;
}
long long int totalDigits(long long int n) {
  long long int number_of_digits = 0;
  for (long long int i = 1; i <= n; i *= 10) number_of_digits += (n - i + 1);
  return number_of_digits;
}
int main() {
  long long int n, m, flag = 1;
  cin >> n >> m;
  vector<long long int> ad[n];
  for (long long int i = 0; i < m; i++) {
    long long int x, y;
    cin >> x >> y;
    x--;
    y--;
    ad[x].push_back(y);
    ad[y].push_back(x);
  }
  vector<long long int> v(n);
  for (long long int i = 0; i < n; i++) cin >> v[i];
  flag = 1;
  for (long long int i = 0; i < n; i++) {
    set<long long int> second;
    for (auto child : ad[i]) {
      second.insert(v[child]);
    }
    long long int mama = 1;
    while (second.find(mama) != second.end()) {
      mama++;
    }
    if (mama != v[i]) {
      flag = 0;
      break;
    }
  }
  if (!flag)
    cout << "-1\n";
  else {
    vector<long long int> adn[n];
    for (long long int i = 0; i < n; i++) {
      adn[v[i] - 1].push_back(i + 1);
    }
    for (long long int i = 0; i < n; i++) {
      for (auto child : adn[i]) cout << child << " ";
    }
    cout << endl;
  }
}
