#include using namespace std; //#include //using namespace atcoder; //using mint = modint998244353; //多倍長整数// //#include //namespace mp = boost::multiprecision; //using Bint = mp::cpp_int; const int INF = 1e9; const int MOD = 998244353; const long long LINF = 4e18; using ll = long long; using vi = vector; using vl = vector; using vs = vector; using vc = vector; using vb = vector; using vvi = vector>; using vvvi = vector>>; using vvvvi = vector>>>; using vvl = vector>; using vvvl = vector>>; using vvvvl = vector>>>; using vvc = vector>; using vvb = vector>; using vvvb = vector>>; using vvvvb = vector>>>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define dump(x) cout << #x << " = " << (x) << endl; #define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl #define ALL(obj) (obj).begin(),(obj).end() vvi g(2e5); int n,m; int s,t,k; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; cin >> s >> t >> k; s--;t--; rep(i,m){ int a,b; cin >> a >> b; a--;b--; g[a].push_back(b); g[b].push_back(a); } vi dist(n,INF); dist[s] = 0; queue que; que.push(s); while(!que.empty()){ int cur = que.front(); que.pop(); for(int next : g[cur]){ if(dist[next] != INF) continue; dist[next] = dist[cur] + 1; que.push(next); } } if(dist[t] <= k && dist[t]%2 == k%2){ cout << "Yes" << endl; return 0; } assert(false); return 0; }