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

int main() {
	int n, m;
	cin >> n >> m;
	int a[n];
	for (auto &i : a) {
		cin >> i;
	}
	vector<int> from, to;
	for (int i = 0; i < m; i++) {
		int puni, muni;
		cin >> puni >> muni;
		puni--;
		muni--;
		from.emplace_back(puni);
		to.emplace_back(muni);
		from.emplace_back(muni);
		to.emplace_back(puni);
	}
	for (int i = 0; i < 2 * m; i++) {
		for (int j = 0; j < 2 * m; j++) {
			if (i == j || to[i] != from[j] || from[i] == to[j] || a[from[i]] == a[to[i]] || a[from[i]] == a[to[j]] || a[to[i]] == a[to[j]]) {
				continue;
			}
			int min_v = min({a[from[i]], a[to[i]], a[to[j]]});
			int max_v = max({a[from[i]], a[to[i]], a[to[j]]});
			if (min_v == a[to[i]] || max_v == a[to[i]]) {
				cout << "YES" << endl;
				return 0;
			}
		}
	}
	cout << "NO" << endl;
	return 0;
}