#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M,S,T;
ll K;
vector<int> E[2020];
ll dp[2][2020][2];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>K>>S>>T;
	S--,T--;
	FOR(i,N) FOR(x,2) FOR(y,2) dp[x][i][y]=1LL<<60;
	FOR(i,M) {
		cin>>x>>y;
		E[x-1].push_back(y-1);
		E[y-1].push_back(x-1);
	}
	
	queue<int> Q;
	dp[0][S][0]=dp[1][T][0]=0;
	Q.push(0*100000+S*10+0);
	Q.push(1*100000+T*10+0);
	while(Q.size()) {
		int id=Q.front()/100000;
		int cur=Q.front()/10%10000;
		int p=Q.front()%2;
		Q.pop();
		FORR(e,E[cur]) if(chmin(dp[id][e][p^1],dp[id][cur][p]+1)) Q.push(id*100000+e*10+(p^1));
	}
	
	if(dp[0][T][K%2]<=K) {
	assert(0);
		cout<<"Yes"<<endl;
		return;
	}
	FOR(x,N) FOR(y,N) if(x!=y) {
		FOR(i,2) FOR(j,2) if(K%2==(i+j+1)%2&&dp[0][x][i]+dp[1][y][j]+1<=K) {
	assert(0);
			cout<<"Yes"<<endl;
			return;
		}
	}
	cout<<"No"<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}