/**
	author:  shobonvip
	created: 2025.10.03 21:49:18
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll n,m,k,s,t;
	cin >> n >> m >> k >> s >> t;
	s--; t--;
	vector<ll> u(m), v(m);
	rep(i,0,m) {
		cin >> u[i] >> v[i];
		u[i]--; v[i]--;
	}

	if (k % 2 == 1) {
		cout << "Yes\n";
		assert(false);
		return 0;
	}

	dsu uf(n);
	vector edge(n, vector<int>(n));
	vector<int> deg(n);
	rep(i,0,m) {
		uf.merge(u[i], v[i]);
		edge[u[i]][v[i]] = 1;
		edge[v[i]][u[i]] = 1;
		deg[u[i]]++;
		deg[v[i]]++;
	}

	if (deg[s] >= 2 && edge[s][t] == 1) {
		cout << "Yes\n";
		return 0;
	}

	if (deg[t] >= 2 && edge[s][t] == 1) {
		cout << "Yes\n";
		return 0;
	}

	if (deg[s] >= 1 && edge[s][t] == 0) {
		cout << "Yes\n";
		return 0;
	}

	if (deg[t] >= 1 && edge[s][t] == 0) {
		cout << "Yes\n";
		return 0;
	}

	
	cout << "No\n";

	
}