import io
import sys
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
from bisect import bisect_right, bisect_left
from math import gcd
import math

_INPUT = """\
6
3 3
0 1
0 2
1 2
0 0 0
3 3
0 1
0 2
1 2
2 0 1
4 4
0 1
0 3
1 2
2 3
0 1 2
"""

def bfs(G,D,s):
  D[s]=0
  dq=deque()
  dq.append(s)
  res=[]
  while dq:
    x=dq.popleft()
    res.append(x)
    for y in G[x]:
      if D[y]>D[x]+1:
        D[y]=D[x]+1
        dq.append(y)
  return len(res), sum([len(G[x]) for x in res])//2

def input():
  return sys.stdin.readline()[:-1]

def solve(test):
  N,M=map(int, input().split())
  G=[[] for _ in range(N)]
  for _ in range(M):
    a,b=map(int, input().split())
    G[a].append(b)
    G[b].append(a)
  v0,v1,v2=map(int, input().split())
  inf=10**30
  D=[inf]*N
  ans='No'
  if len([v0,v1,v2])==3 and v0 in G[v1] and v0 in G[v2] and v1 in G[v0] and v1 in G[v2] and v2 in G[v0] and v2 in G[v1]:
    G[v0].remove(v1)
    G[v1].remove(v0)
  for i in range(N):
    if D[i]==inf:
      p,edge=bfs(G,D,i)
      if edge>=p:
        ans='Yes'
        break
  print(ans)

def random_input():
  from random import randint,shuffle
  N=randint(1,10)
  M=randint(1,N)
  A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)]
  shuffle(A)
  return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3

def simple_solve():
  return []

def main(test):
  if test==0:
    solve(0)
  elif test==1:
    sys.stdin = io.StringIO(_INPUT)
    case_no=int(input())
    for _ in range(case_no):
      solve(0)
  else:
    for i in range(1000):
      sys.stdin = io.StringIO(random_input())
      x=solve(1)
      y=simple_solve()
      if x!=y:
        print(i,x,y)
        print(*[line for line in sys.stdin],sep='')
        break

#0:提出用、1:与えられたテスト用、2:ストレステスト用
main(0)