#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    long long N,M,K,s,t; cin >> N >> M >> K >> s >> t,s--,t--;
    vector<vector<int>> Graph(N);
    for(int i=0; i<M; i++){
        int u,v; cin >> u >> v;
        u--; v--;
        Graph.at(u).push_back(v);
        Graph.at(v).push_back(u);
    }
    if(K%2){cout << "Yes\n"; return 0;} //奇数回移動はs-tを結び往復.
    if(Graph.at(s).size() == 1 && Graph.at(t).size() == 1 && Graph.at(s).at(0) == t){ //なるほどね.
        for(int F=0; F<N; F++){
            if(F == s || F == t) continue;
            Graph.at(s).push_back(F);
            Graph.at(F).push_back(s);
            vector<int> odd(N,-1),even(N,-1);
            queue<pair<int,int>> Q;
            even.at(s) = 0,Q.push({s,0});
            while(Q.size()){
                auto [pos,pari] = Q.front(); Q.pop();
                for(auto to : Graph.at(pos)){
                    if(pari == 0){
                        if(odd.at(to) != -1) continue;
                        odd.at(to) = even.at(pos)+1,Q.push({to,pari^1});
                    }
                    else{
                        if(even.at(to) != -1) continue;
                        even.at(to) = odd.at(pos)+1,Q.push({to,pari^1});
                    }
                }
            }
            if(even.at(t) <= K && even.at(t) != -1){cout << "Yes\n"; return 0;}

            Graph.at(s).pop_back();
            Graph.at(F).pop_back();
        }
        cout << "No\n";
    }
    else if(Graph.at(s).size() == 0 && Graph.at(t).size() == 0 && K%2 == 0) cout << "No\n";
    else cout << "Yes\n"; // s/tから1回の移動先にt/sと結べば往復でok.
}