#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

bool solve() {
  int n, m, s, t;
  ll k;
  cin >> n >> m >> k >> s >> t;
  s--, t--;
  VVI to(n);
  rep(_, m) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    to[u].emplace_back(v);
    to[v].emplace_back(u);
  }
  if (k % 2) return true;
  if (to[s].empty() && to[t].empty()) return false;
  if (auto it = ranges::find(to[s], t); it != to[s].end()) to[s].erase(it);
  if (auto it = ranges::find(to[t], s); it != to[t].end()) to[t].erase(it);
  if (to[s].size() || to[t].size()) return true;
  constexpr int INF = 1001001001;
  int mn = INF;
  rep(sv, n) {
    queue<int> q;
    VI dist(2 * n, INF);
    dist[sv] = 0;
    q.emplace(sv);
    while (q.size()) {
      int u = q.front(); q.pop();
      for (int v : to[u % n]) {
        if (u < n) v += n;
        if (dist[v] == INF) {
          dist[v] = dist[u] + 1;
          q.emplace(v);
        }
      }
    }
    chmin(mn, dist[sv + n]);
  }
  return mn != INF && 1 + mn + 1 + 1 <= k;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << (solve() ? "Yes\n" : "No\n");
}