#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(v) v.begin(),v.end()
#define dbg(x) cerr << #x << ": " << (x) << endl;
int n,m;
vector<vector<int>> g;
vector<int> v(3);
int main() {
    cin >> n >> m;
    g.resize(n, vector<int>(n));
    for (int i = 0; i < m; ++i) {
        int a,b;
        cin >> a >> b;
        g[a][b] = g[b][a] = 1;
    }
    for (int &i : v) cin >> i;
    sort(ALL(v));

    for (int i = 1; i < 1<<n; ++i) {
        vector<int> p;
        for (int j = 0; j < n; ++j) {
            if (i >> j & 1) p.push_back(j);
        }
        if (p == v) continue;
        if (p.size() <= 2) continue;
        do {
            bool ok = true;
            for (int j = 0; j < p.size(); ++j) {
                int nx = p[(j+1) % p.size()];
                if (g[p[j]][nx] == 0) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                // for (int j = 0; j < p.size(); ++j) {
                //     cerr << p[j] << " \n"[j==p.size()-1];
                // }
                cout << "Yes\n";
                return 0;
            }
        } while (next_permutation(ALL(p)));
    }
    cout << "No\n";
}