#include using namespace std; #include // using mint = atcoder::modint998244353; using ld = long double; #define fi first #define se second #define all(x) x.begin(),x.end() #define rep(i,n) for(int i=0;i<(int)(n);++i) templatebool chmin(T&a,T b){return bbool chmax(T&a,T b){return b>a?(a=b,1):0;} int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); long N,M,K,S,T; cin>>N>>M>>K>>S>>T; S--;T--; atcoder::dsu uf(N); vector> es(M); rep(i,M){ int u,v; cin>>u>>v; u--;v--; uf.merge(u,v); es[i]={u,v}; } if(uf.size(S)==1&&uf.size(T)==1){ cout<<(K%2?"Yes\n":"No\n"); } else if(!uf.same(S,T)||uf.size(S)>=3) cout<<"Yes\n"; else{ if(K%2==1){ cout<<"Yes\n"; return 0; } long mi=2e18; rep(r,M){ vector> G(N); rep(i,M)if(i!=r) G[es[i].se].push_back(es[i].fi), G[es[i].fi].push_back(es[i].se); vector dp(N,vector(2,1e18)); queue> q; q.push({es[r].fi,0}); dp[es[r].fi][0]=0; while(!q.empty()){ auto [v,p]=q.front(); q.pop(); for(int e: G[v]){ if(dp[e][1-p]!=1e18) continue; dp[e][1-p]=dp[v][p]+1; q.push({e,1-p}); } } chmin(mi, (long)dp[es[r].se][0]); } if(mi+3<=K) cout<<"Yes\n"; else cout<<"No\n"; } }