#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N, M;
    cin >> N >> M;
    vector<vector<bool>> G(N, vector<bool>(N, false));
    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v;
        G[u][v] = G[v][u] = true;
    }
    int a, b, c;
    cin >> a >> b >> c;

    bool ans = false;
    vector<int> p;
    auto dfs = [&](auto dfs) -> void {
        if (p.size() > 2) {
            bool ok = true;
            for (int i = 0; i < ssize(p); i++) {
                if (!G[p[i]][p[(i + 1) % ssize(p)]]) ok = false;
            }
            if (set<int>(p.begin(), p.end()) == set<int>({a, b, c})) ok = false;
            if (set<int>(p.begin(), p.end()).size() != ssize(p)) ok = false;
            if (ok) ans = true;
        }
        if (p.size() == N) return;
        for (int i = 0; i < N; i++) {
            p.push_back(i);
            dfs(dfs);
            p.pop_back();
        }
    };

    dfs(dfs);

    puts(ans ? "Yes" : "No");
}