#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, M, K, s, t;
    cin >> N >> M >> K >> s >> t;
    s--;
    t--;
    vector<ll> u(M);
    vector<ll> v(M);
    for (ll i = 0; i < M; i++){
        cin >> u[i] >> v[i];
        u[i]--;
        v[i]--;
    }
    vector<vector<ll>> graph(N, vector<ll>(0));
    for (ll i = 0; i < M; i++){
        graph[u[i]].push_back(v[i]);
        graph[v[i]].push_back(u[i]);
    }

    // その頂点から開始してその頂点に戻ってくる、奇数長の最短ウォークを求める
    ll INF = 2000000000000000023;
    vector<ll> odd_walk(N, INF);
    for (ll i = 0; i < N; i++){
        vector<vector<ll>> dist(N, vector<ll>(2, INF));
        queue<pll> que;
        dist[i][0] = 0;
        que.push(make_pair(i, 0));
        while (que.size()){
            pll p = que.front();
            que.pop();
            ll px = p.first;
            ll ppar = p.second;
            for (ll x: graph[px]){
                ll npar = 1 ^ ppar;
                if (dist[x][npar] == INF){
                    dist[x][npar] = dist[px][ppar] + 1;
                    que.push(make_pair(x, npar));
                }
            }
        }
        if (dist[i][1] < INF){
            odd_walk[i] = dist[i][1];
        }
    }
    // debug(odd_walk);
    if (K % 2 == 1){
        cout << "Yes" << endl;
    }
    else{
        if (graph[s].size() == 0 && graph[t].size() == 0){
            cout << "No" << endl;
        }
        else if (graph[s].size() == 1 && graph[t].size() == 1 && graph[s][0] == t && graph[t][0] == s){
            ll min_d = INF;
            for (ll i = 0; i < N; i++){
                min_d = min(min_d, odd_walk[i]);
            }
            if (min_d + 3 <= K){
                cout << "Yes" << endl;
            }
            else{
                cout << "No" << endl;
            }
        }
        else{
            cout << "Yes" << endl;
        }
    }
}