#include <bits/stdc++.h>
using namespace std;

#define rep(i,j,n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(), i.rend()
#define INF 1e9
#define LINF 1e18
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(i64 n, i64 m) {return (m == 0? n : gcd(m, n % m));}
i64 lcd(i64 n, i64 m) {return (n / gcd(n, m) * m);}
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  int n, m;
  cin >> n >> m;
  vt<int> a(n);
  rep(i, 0, n) cin >> a[i];
  vvt<int> edge(n);
  rep(i, 0, m) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    edge[u].push_back(a[v]);
    edge[v].push_back(a[u]);
  }

  rep(i, 0, n) {
    sort(all(edge[i]));
    edge[i].erase(unique(all(edge[i])), edge[i].end());
  }

  rep(i, 0, n) {
    int lo = (lower_bound(all(edge[i]), a[i]) - edge[i].begin());
    int up = edge[i].size() - (upper_bound(all(edge[i]), a[i]) - edge[i].begin());
    if(lo >= 2 || up >= 2) return cout << "YES\n", 0;
  }
  cout << "NO\n";
}