#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <bitset>

#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <ctime>
////
//#include <random>//
#pragma endregion //#include
/////////

#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N,M;
	cin>>N>>M;
	vector<LL> A(N);
	for(int i=0;i<N;++i){
		cin>>A[i];
	}
	vector<vector<LL> > G(N);
	for(int i=0;i<M;++i){
		int a,b;
		cin>>a>>b;
		--a;--b;
		G[a].push_back( A[b] );
		G[b].push_back( A[a] );
	}
	for(int i=0;i<N;++i){
		sort(G[i].begin(),G[i].end());
		G[i].erase(unique(G[i].begin(),G[i].end()),G[i].end());

		vector<LL>::iterator itr;
		itr = lower_bound(G[i].begin(),G[i].end(),A[i]);
		int count = itr-G[i].begin();
		if( count >= 2 ){
			cout << "YES" << endl;
			return;
		}
		itr = upper_bound(G[i].begin(),G[i].end(),A[i]);
		count = itr-G[i].begin();
		int MAX = G[i].size();
		if( MAX - count >= 2 ){
			cout << "YES" << endl;
			return;
		}
	}
	cout << "NO" << endl;
	return;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()