#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<bitset>
#include<random>
#define INF 1000000000ll
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
vector<ll> a;
vector<vector<ll>> adj;
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n,m;
	cin>>n>>m;
	a.resize(n);
	adj.resize(n);
	REP(i,n) cin>>a[i];
	REP(i,m) {
		ll u,v;
		cin>>u>>v;
		u--;
		v--;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	REP(i,n) {
		set<ll> sita,ue;
		REP(j,(ll)adj[i].size()) {
			if(a[adj[i][j]]<a[i]) sita.insert(a[adj[i][j]]);
			if(a[adj[i][j]]>a[i]) ue.insert(a[adj[i][j]]);
		}
		if((ll)sita.size()>=2||(ll)ue.size()>=2) {
			cout<<"YES"<<endl;
			return 0;
		}
	}
	cout<<"NO"<<endl;
}