#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int INF = (int)1e9 + 1001010;
const ll llINF = (long long)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {
    return vector(i, vector<T>(j, init));
}
const string ELM_SEP = " ", VEC_SEP = endn;
template <class T> istream &operator>>(istream &i, vector<T> &A) {
    for(auto &I : A) i >> I;
    return i;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &A) {
    int sz = A.size();
    for(const auto &I : A) o << I << (--sz ? ELM_SEP : "");
    return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<vector<T>> &A) {
    int sz = A.size();
    for(const auto &I : A) o << I << (--sz ? VEC_SEP : "");
    return o;
}
template <class T> vector<T> &operator++(vector<T> &A, int) {
    for(auto &I : A) I++;
    return A;
}
template <class T> vector<T> &operator--(vector<T> &A, int) {
    for(auto &I : A) I--;
    return A;
}
template <class T, class U> bool chmax(T &a, const U &b) { return ((a < b) ? (a = b, true) : false); }
template <class T, class U> bool chmin(T &a, const U &b) { return ((a > b) ? (a = b, true) : false); }
ll floor_div(ll a, ll b) {
    if(b < 0) a = -a, b = -b;
    return (a >= 0) ? a / b : (a + 1) / b - 1;
}
ll ceil_div(ll a, ll b) {
    if(b < 0) a = -a, b = -b;
    return (a > 0) ? (a - 1) / b + 1 : a / b;
}
bool check_bit(ull val, ull digit) { return (val >> digit) & 1; }
#ifdef DEBUG
#include <cpp-dump/cpp-dump.hpp>
#define dump(...) cpp_dump(__VA_ARGS__)
namespace cp = cpp_dump;
struct InitCppDump {
    InitCppDump() {
        if(!isatty(fileno(stderr))) CPP_DUMP_SET_OPTION(es_style, cpp_dump::types::es_style_t::no_es);
        CPP_DUMP_SET_OPTION(log_label_func, cp::log_label::line());
        CPP_DUMP_SET_OPTION(max_iteration_count, 30);
    }
} init_cpp_dump;
#else
#define dump(...)
#endif
// ==================== ここまでテンプレ ====================

int main(int argc, char *argv[]) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n, m, k, s, t;
    cin >> n >> m >> k >> s >> t;
    s--, t--;

    auto graph = vector2<int>(n, 0);
    for(int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        graph[u].emplace_back(v);
        graph[v].emplace_back(u);
    }

    if(k % 2 == 1) {
        cout << "Yes" << endl;
    }
    else {
        // k が偶数のとき
        {
            // s, t に互い以外の連結頂点があるならOK
            bool ok = false;
            for(auto vtx : graph[s]) ok |= (vtx != t);
            for(auto vtx : graph[t]) ok |= (vtx != s);

            if(ok) {
                cout << "Yes" << endl;
                return 0;
            }
        }

        if(find(graph[s].begin(), graph[s].end(), t) != graph[s].end()) {
            // s, t がすでに連結であるとき
            for(int from = 0; from < n; from++) {
                vector<int> dist(n, INF);
                dist[from] = 0;
                queue<int> que;
                que.emplace(from);
                while(!que.empty()) {
                    int now = que.front();
                    que.pop();
                    for(auto nxt : graph[now]) {
                        if(dist[nxt] != INF) continue;
                        dist[nxt] = dist[now] + 1;
                        que.emplace(nxt);
                    }
                }

                for(auto to : graph[from]) {
                    // Kと比べて短い奇数長のサイクルがあれば OK
                    if(dist[to] != INF && (dist[to] + 1) % 2 == 1 && (dist[to] + 3) <= k) {
                        cout << "Yes" << endl;
                        return 0;
                    }
                }
            }
        }

        cout << "No" << endl;
    }
    return 0;
}