#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(x,y) (x=min(x,y))
#define chmax(x,y) (x=max(x,y))
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}
#define N 1010
vector<int> g[N];
int a[N];
int main(){
	int n, m;
	cin>>n>>m;
	rep(i, n) cin>>a[i];
	rep(j, m){
		int u, v;
		cin>>u>>v;
		u--; v--;
		g[u].pb(a[v]);
		g[v].pb(a[u]);
	}
	bool ok = false;
	rep(i, n){
		sort(all(g[i]));
		UNIQUE(g[i]);
		if(g[i].size()<2) continue;
		int b = a[i];
		if(g[i][1]<b||b<g[i][g[i].size()-2]) ok = true;
	}
	cout<<(ok?"YES":"NO")<<endl;
	return 0;
}