#include<iostream>
#include<atcoder/all>
#include<vector>
#include<algorithm>
#include<bits/stdc++.h>
#include<math.h>
#include <numeric>
#include <random>
#include<map>
#include<queue>
#include<deque>
#include <bitset>
#include<stack>
#include<set>
using namespace std;
using namespace atcoder;
#define int long long
using mint=modint998244353;
double pi=3.141592653589793128;
//cout << fixed << setprecision(10);
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for (int i=0;i<(n);++i)
#define prep(i,n) for (int i=1;i<=(n);++i)
#define ep(i,j,n) for (int i=j+1;i<=(n);++i)
long long INF = 900000000000000;
int mod=998244353;

signed main(){
   int n,m,k,s,t;cin>>n>>m>>k>>s>>t;
   s--;t--;
   vector<int> g[n];
   rep(i,m){
     int u,v;cin>>u>>v;u--;v--;
     g[u].push_back(v);
     g[v].push_back(u);
   }
   if(g[s].size()==0 && g[t].size()==0 && k%2==0)cout<<"No";
   else{
     cout<<"Yes";
   }
}