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

template <class T> struct csr {
    using itr = typename std::vector<T>::iterator;
    struct Node {
        itr st, en;
        itr begin() { return st; }
        itr end() { return en; }
        int size() { return en - st; }
        T operator[](int p){ return st[p]; }
    };
    const int N;
    std::vector<int> start;
    std::vector<T> E;
    std::vector<std::pair<int,T>> edge;
    csr(int n) : N(n), start(n + 1) {}
    void add_edge(int u, T v){
        assert(0 <= u && u < N);
        start[u + 1]++;
        edge.emplace_back(u, v);
    }
    void build(){
        E.resize(edge.size());
        for(int i = 0; i < N; i++) start[i + 1] += start[i];
        auto cnt = start;
        for(auto [u, v] : edge) E[cnt[u]++] = v;
    }
    Node operator[](int p) {
        return Node{E.begin() + start[p], E.begin() + start[p + 1]};
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, s, t, u, v;
    ll k;
    cin >> n >> m >> k >> s >> t;
    s--, t--;
    if(k % 2 == 1){
        cout << "Yes\n";
        return 0;
    }
    assert(s != t);
    csr<int> g(n);
    vector<array<bool,2000>> B(n);
    for(int i = 0; i < n; i++){
        B[i].fill(false);
        B[i][i] = true;
    }
    for(int i = 0; i < m; i++){
        cin >> u >> v;
        u--, v--;
        B[u][v] = B[v][u] = true;
        g.add_edge(u, v);
        g.add_edge(v, u);
    }
    g.build();
    queue<pair<int,int>> que;
    auto bfs = [&](int from){
        vector<array<ll,2>> dp(n);
        for(int i = 0; i < n; i++) dp[i].fill(1ll << 60);
        que.emplace(from, 0);
        dp[from][0] = 0;
        while(!que.empty()){
            auto [v, s] = que.front();
            que.pop();
            for(auto u : g[v]){
                if(dp[v][s] + 1 >= dp[u][s ^ 1]) continue;
                dp[u][s ^ 1] = dp[v][s] + 1;
                que.emplace(u, s ^ 1);
            }
        }
        return dp;
    };
    auto d1 = bfs(s);
    auto d2 = bfs(t);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(B[i][j]) continue;
            for(int S = 0; S < 4; S++){
                ll c = d1[i][S / 2] + d2[j][S & 1] + 1;
                if(c <= k && (k - c) % 2 == 0){
                    cout << "Yes\n";
                    return 0;
                }
            }
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 4; j++){
            ll c = d1[i][j / 2] + d2[i][j & 1];
            if(c <= k && (k - c) % 2 == 0){
                cout << "Yes\n";
                return 0;
            }
        }
    }
    assert(min(d1[t][0], d1[t][1]) == (1ll << 60));
    int cnt = g[s].size() + g[t].size() - (B[s][t] ? 2 : 0);
    if(cnt >= 1){
        cout << "Yes\n";
        return 0;
    }
    cout << "No\n";
}