#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <cstring>
#include <queue>
#include <bitset>
#include <map>
#include <stack>

using namespace std;

long long int n,m,k,s,t,u,v;
bool e[2001][2001];
long long int dp[2001][2][2];

int main() 
{
	cin.tie(0);
    ios::sync_with_stdio(false);

	cin >> n >> m >> k >> s >> t;
	for(int i=0;i<m;i++)
	{
		cin >> u >> v;
		e[u][v] = true;
		e[v][u] = true;
	}

	memset(dp,-1,sizeof(dp));

	dp[s][0][0] = 0;
	dp[t][1][0] = 0;
	queue <pair<int,pair<int,int>>> que;
	que.push(make_pair(s,make_pair(0,0)));
	que.push(make_pair(t,make_pair(1,0)));

	while(!que.empty())
	{
		int now = que.front().first;
		int state = que.front().second.first;
		int p = que.front().second.second;
		que.pop();

		for(int next=1;next<=n;next++)
		{
			if(now==next) continue;
			if(e[now][next])
			{
				if(dp[next][state][1-p]==-1)
				{
					dp[next][state][1-p] = dp[now][state][p] + 1;
					que.push(make_pair(next,make_pair(state,1-p)));
				}
			}
		}
	}

	if(dp[t][0][k%2]!=-1)
	{
		if(dp[t][0][k%2] <= k)
		{
			cout << "Yes" << '\n';
			return 0;
		}
	}

	for(int a=1;a<=n;a++)
	{
		for(int b=1;b<=n;b++)
		{
			if(a==b) continue;
			if(e[a][b]==false)
			{
				for(int j=0;j<2;j++)
				{
					if(dp[a][0][j]==-1) continue;
					for(int k=0;k<2;k++)
					{
						if(dp[b][1][k]!=-1) continue;
						long long int D = dp[a][0][j] + dp[b][1][k];
						D+=1;
						if((k-D)%2==0 && D<=k)
						{
							cout << "Yes" << '\n';
							return 0;
						}
					}
				}
			}
		}
	}
	cout << "No" << '\n';

    return 0;
}