#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

int main(){
    int N, M;
    cin >> N >> M;
    int scores[N];
    for(int i = 0; i < N; i++){
        cin >> scores[i];
    }
    vector<int> roads[N];
    for(int i = 0; i < M; i++){
        int start, goal;
        cin >> start >> goal;
        roads[start - 1].push_back(goal - 1);
        roads[goal - 1].push_back(start - 1);
    }
    for(int i = 0; i < N; i++){
        map<int, bool> small, big;
        for(int j = 0; j < roads[i].size(); j++){
            if(scores[i] > scores[roads[i][j]]){
                small[scores[roads[i][j]]] = true;
            }else if(scores[i] < scores[roads[i][j]]){
                big[scores[roads[i][j]]] = true;
            }
        }
        if(small.size() >= 2 || big.size() >= 2){
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
}