#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

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

    int n,m;
    cin>>n>>m;
    vector<vector<int>> g(n,vector<int>(n,0));
    vector<int> a(3);
    for(int i = 0;i<m;i++){
        int u,v;
        cin>>u>>v;
        g[u][v] = g[v][u] = 1;
    }
    for(int i = 0;i<3;i++) cin>>a[i];
    sort(a.begin(),a.end());
    vector<int> idx(n);
    for(int i = 0;i<n;i++) idx[i] = i;
    do{
        if(idx.size()<3) continue;
        vector<int> use;
        for(int i = 0;i<3;i++) use.push_back(idx[i]);
        sort(use.begin(),use.end());
        if(use==a) continue;
        if(g[idx[0]][idx[1]]==1&&g[idx[1]][idx[2]]==1&&g[idx[0]][idx[2]]==1){
            cout<<"Yes\n";
            return 0;
        }
    }while(next_permutation(idx.begin(),idx.end()));
    cout<<"No\n";
}