#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<P> es(m);
  for (auto& [u, v] : es) cin >> u >> v;
  sort(all(es));
  int bad = 0;
  rep(_, 3) {
    int x;
    cin >> x;
    bad |= 1 << x;
  }
  if (m == 0) {
    cout << "No\n";
    return 0;
  }
  do {
    rep(_, 2) {
      int v0 = es[0].first;
      int visited = 1 << v0;
      int now = v0;
      for (auto [u, v] : es) {
        if (now == u || now == v) now ^= u ^ v;
        else break;
        visited |= 1 << now;
        if (visited != bad && now == v0) {
          cout << "Yes\n";
          return 0;
        }
      }
      swap(es[0].first, es[0].second);
    }
  } while (next_permutation(all(es)));
  cout << "No\n";
}