#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m; cin >> n >> m;
	long long k; cin >> k;
	int s, t; cin >> s >> t;
	s--, t--;
	dsu uf(n);
	vector to(n, vector<int>());
	bool st = false;
	rep(i, m) {
		int u, v; cin >> u >> v;
		u--, v--;
		rep(_, 2) {
			to[u].push_back(v);
			swap(u, v);
			if (s == u && t == v)st = true;
		}
		uf.merge(u, v);
	}
	if (k % 2) {
		// s->t->s->t
		cout << "Yes" << endl;
		return 0;
	}
	// s,tともに孤立
	if (to[s].size() == 0 && to[t].size() == 0) {
		cout << "No" << endl;
		return 0;
	}
	// s->x->t->x->t....
	if (st) {
		if (to[s].size() != 1 || to[t].size() != 1) {
			cout << "Yes" << endl;
			return 0;
		}
	}
	else {
		if (to[s].size() != 0 || to[t].size() != 0) {
			cout << "Yes" << endl;
			return 0;
		}
	}
	// sはtののみ連結,k%2==0
	// s->t->u->?????->u->t
	// ?????のサイズが偶数？
	// uから奇数ターンでuに戻ってくればいいのでそれの最小を出す
	long long mn = LINF * 2;
	rep(i, n) {
		vector dp(n, vector<long long>(2, LINF));
		dp[i][0] = 0;
		queue<P>que;
		que.emplace(i, 0);
		while (!que.empty()) {
			auto[v, t] = que.front();
			que.pop();
			for (auto nv : to[v]) {
				int nval = dp[v][t] + 1;
				int nt = t ^ 1;
				if (chmin(dp[nv][nt], nval)) {
					que.emplace(nv, nt);
				}
			}
		}
		chmin(mn, dp[i][1]);
	}
	if (mn + 3 <= k) cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}