N,M,K,X,Y=map(int,input().split()) G=[[] for i in range(N)] for i in range(M): a,b=map(int,input().split()) G[a-1].append(b-1) G[b-1].append(a-1) ans=False from collections import deque dist=[-1]*N for i in range(N): if dist[i]==-1: dist[i]=0 S=deque() S.append(i) while S: x=S.popleft() for y in G[x]: if dist[y]==-1: dist[y]=dist[x]^1 else: if dist[y]!=dist[x]^1: ans=True break if len(G[X-1])==1 and G[X-1][0]==Y-1: if K%2==1: print('Yes') exit() if len(G[Y-1])>1: print('Yes') exit() if ans==True: print('Yes') else: print('No') exit() if len(G[X-1])+len(G[Y-1])>0: print('Yes') else: if K%2==1: print('Yes') else: print('No')