#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, M;
	cin >> N >> M;
	vector<int> A(N);
	int res = 0;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
	vector<vector<int> > ed(N);
	int a, b;
	for (int i = 0; i < M; i++) {
		cin >> a >> b;
		a--;
		b--;
		ed[a].push_back(b);
		ed[b].push_back(a);
	}
	bool f = false;
	set<int> c0, c1;
	for (int i = 0; i < N; i++) {
		c0.clear();
		c1.clear();
		for (int j = 0; j < ed[i].size(); j++) {
			if (A[i] < A[ed[i][j]]) {
				c0.insert(A[ed[i][j]]);
			}
			else if (A[i] > A[ed[i][j]]) {
				c1.insert(A[ed[i][j]]);
			}
		}
		if ((int)c0.size() > 1 || (int)c1.size() > 1) {
			f = true;
			break;
		}
	}
	if (f) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
}