#include <bits/stdc++.h>
using namespace std;
#include<atcoder/all>
// 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)
template<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}
template<typename T>bool 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<vector<int>> G(N);
    rep(i,M){
        int u,v;
        cin>>u>>v;
        u--;v--;
        uf.merge(u,v);
        G[v].push_back(u);
        G[u].push_back(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{
        assert(0);
        assert(uf.same(S,T)&&uf.size(S)==2&&uf.size(T)==2);
        if(K%2==1){
            cout<<"Yes\n";
            return 0;
        }
        long mi=2e18;
        rep(s,N){
            vector dp(N,vector<int>(2,1e9));
            queue<pair<int,int>> q;
            q.push({s,0});
            dp[s][0]=0;
            while(!q.empty()){
                auto [v,p]=q.front();
                q.pop();
                for(int e: G[v]){
                    if(dp[e][1-p]!=1e9) continue;
                    dp[e][1-p]=dp[v][p]+1;
                    q.push({e,1-p});
                }
            }
            chmin(mi, (long)dp[s][1]);
        }
        if(mi+3<=K) cout<<"Yes\n";
        else cout<<"No\n";
    }
}