#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;

int main(int argc, char* argv[])
{
    int n,m;
    scanf("%d%d", &n, &m);
    
    vector<int> a(n);
    int i;
    for(i=0; i<n; i++) {
        scanf("%d", &a[i]);
    }
    vector<vector<int> > g(n);   // to
    for(i=0; i<m; i++) {
        int tmp0,tmp1;
        scanf("%d%d", &tmp0, &tmp1);
        g[tmp0-1].push_back(tmp1-1);
        g[tmp1-1].push_back(tmp0-1);
    }

    int k;
    for(i=0; i<n; i++) {
        set<int> s0, s1;
        for(k=0; k<(int)g[i].size(); k++) {            
            int next = a[g[i][k]];
            if(next<a[i])       s0.insert(next);
            else if(next>a[i])  s1.insert(next);
        }
        if(s0.size()>1 || s1.size()>1) {
            printf("YES\n"); return 0;
        }

    }
    printf("NO\n");

    return 0;
}