#include <iostream>
#include <vector>
#include <set>

template <class Cost = int>
struct Edge {
    int src, dst;
    Cost cost;
    Edge(int src = -1, int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = int>
using Graph = std::vector<std::vector<Edge<Cost>>>;

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;

    Graph<> graph(n);
    while (m--) {
        int u, v;
        std::cin >> u >> v;
        --u, --v;
        graph[u].emplace_back(u, v);
        graph[v].emplace_back(v, u);
    }

    for (int v = 0; v < n; ++v) {
        auto x = xs[v];

        std::set<int> ls, rs;
        for (auto e : graph[v]) {
            auto y = xs[e.dst];
            if (y < x) ls.insert(y);
            if (y > x) rs.insert(y);
        }

        if (ls.size() > 1 || rs.size() > 1) {
            std::cout << "YES" << std::endl;
            return;
        }
    }

    std::cout << "NO" << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}