#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)


int main(){
    int n, m; ll k; int s, t; cin >> n >> m >> k >> s >> t;
    vvi adj(n+1);
    rep(i, m){
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    if(k % 2 != 0 || adj[t].size() >= 2){
        cout << "Yes" << endl;
    }else if(adj[t].size() == 0){
        cout << (adj[s].size() >= 1 ? "Yes":"No") << endl;
    }else if(adj[t][0] != s){
        cout << "Yes" << endl;
    }else if(adj[s].size() >= 2){
        cout << "Yes" << endl;
    }else{
        int path = 1e9;
        rep2(i, 1, n+1){
            for(auto a : adj[i]){
                if(i > a)continue;
                vi dist(n+1, -1);
                dist[i] = 0;
                queue<int> q; q.push(i);
                while(!q.empty()){
                    int u = q.front(); q.pop();
                    for(auto v : adj[u]){
                        if((u == i && v == a) || (u == a && v == i))continue;
                        if(dist[v] == -1){
                            if(v == a && dist[u]%2 == 0)continue;
                            dist[v] = dist[u]+1;
                            q.push(v);
                        }
                    }
                }
                if(dist[a] != -1){
                    int tmp = dist[a] + 1;
                    if(tmp % 2 != 0)path = min(path, tmp);
                }
            }
        }
        cout << path << endl;
        if(path == 1e9){
            cout << "No" << endl;
        }else{
            cout << (path + 3 <= k ? "Yes" : "No") << endl;
        }
    }

    return 0;
}