#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using dd = double;
using vdd = std::vector<dd>;
using vvdd = std::vector<vdd>;
using vvvdd = std::vector<vvdd>;

const ll INF = 1LL << 45; //10e5倍してもオーバーフローしない値
const ll MOD = 1000000007LL;// 998244353L;
const dd EPS = 1e-11;

typedef std::numeric_limits< double > dbl;

//cin,cout高速化のおまじない＋桁数指定
struct Fast{
	Fast(){
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast;

#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define REP(i, N) REPS(i, 0, N-1)
#define DEPS(i, E, S) for (ll i = (E); i >= (S); i--)
#define DEP(i, N) DEPS(i, N-1, 0)
#define EACH(e, v) for (auto&& e : v)

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T> &v, ll S, ll E){ T m=v[S]; REPS(i, S, E)chmax(m, v[i]); return m; }//v[S]～v[E]の最大値
template<class T> inline T MinE(vector<T> &v, ll S, ll E){ T m=v[S]; REPS(i, S, E)chmin(m, v[i]); return m; }//v[S]～v[E]の最小値
template<class T> inline T MaxE(vector<T> &v, ll N) { return MaxE(v, 0, N - 1); } //先頭N個中の最大値
template<class T> inline T MinE(vector<T> &v, ll N) { return MinE(v, 0, N - 1); }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v, (ll)v.size()); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v, (ll)v.size()); }
template<class T> inline ll MaxI(vector<T> &v, ll S, ll E){ ll m=S; REPS(i, S, E){ if (v[i]>v[m])m=i; }return m; }
template<class T> inline ll MinI(vector<T> &v, ll S, ll E){ ll m=S; REPS(i, S, E){ if (v[i]<v[m])m=i; }return m; }
template<class T> inline ll MaxI(vector<T> &v, ll N) { return MaxI(v, 0, N - 1); }
template<class T> inline ll MinI(vector<T> &v, ll N) { return MinI(v, 0, N - 1); }
template<class T> inline ll MaxI(vector<T> &v) { return MaxI(v, (ll)v.size()); }
template<class T> inline ll MinI(vector<T> &v) { return MinI(v, (ll)v.size()); }
template<class T> inline T Sum(vector<T> &v, ll S, ll E){ T s=v[S]; REPS(i, S+1, E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v, ll N) { return Sum(v, 0, N - 1); }
template<class T> inline T Sum(vector<T> &v) { return Sum(v, v.size()); }
template<class T> inline T SumMOD(vector<T> &v, ll S, ll E){ T s=v[S]; REPS(i, S+1, E)s=(s+v[i])%MOD; return s; }
template<class T> inline T SumMOD(vector<T> &v, ll N) { return SumMOD(v, 0, N - 1); }
template<class T> inline T SumMOD(vector<T> &v) { return SumMOD(v, v.size()); }

inline ll AddMOD(ll a, ll b) { return (a + b) % MOD; }
inline ll SubMOD(ll a, ll b) { return (a - b + MOD) % MOD; }
inline ll MulMOD(ll a, ll b) { return (a * b) % MOD; }

inline ll in() { ll x; cin >> x; return x; }
inline double inD() { double x; cin >> x; return x; }
inline string inS() { string x; cin >> x; return std::move(x); }
template<class T=ll> inline vector<T> in_v(ll N){ vector<T> v(N); REP(i, N)cin>>v[i]; return move(v); }
inline void To0origin(vll &v) { EACH(e, v) e--; }

ll N, M, S, T;
vvll to;
vvll ot;
vll dist;
vll distR;

inline int idx_(int v, int state){ return v*3+(state+3)%3; }
inline int v_(int idx){ return idx/3; }
inline int state_(int idx){ return idx%3; }

inline ll &Dist (int v, int state){ return dist [idx_(v, state)]; }
inline ll &DistR(int v, int state){ return distR[idx_(v, state)]; }

void bfs(){
	queue<ll> que;
	queue<ll> queR;
	
	Dist (S, 0) = 0;
	DistR(T, 0) = 0;
	que .push(idx_(S, 0));
	queR.push(idx_(T, 0));

	while (!que.empty() && !queR.empty()){
		//キューの少ない方優先
		if (que.size() < queR.size()){//SからBFS
			int idx = que.front();  que.pop();
			int v = v_(idx);
			int state = state_(idx);

			EACH(u, to[v]){
				if (Dist(u, state+1) != -1) continue;
				Dist(u, state+1) = Dist(v, state) + 1;

				if (DistR(u, state+1) != -1){//ぶつかったら終了
					ll ans = Dist(u, state+1) + DistR(u, state+1);
					cout << ans / 3  << '\n';
					return;
				}
				que.push(idx_(u, state+1));
			}
		}
		else{//TからBFS
			int idx = queR.front();  queR.pop();
			int v = v_(idx);
			int state = state_(idx);

			EACH(u, ot[v]){
				if (DistR(u, state-1) != -1) continue;
				DistR(u, state-1) = DistR(v, state) + 1;

				if (Dist(u, state-1) != -1){//ぶつかったら終了
					ll ans = Dist(u, state-1) + DistR(u, state-1);
					cout << ans / 3  << '\n';
					return;
				}
				queR.push(idx_(u, state-1));
			}
		}
	}
	cout << -1 << '\n';
}

int main()
{
	cin >> N >> M;

	to.resize(N);
	ot.resize(N);
	REP(i, M){
		ll v, u;
		cin >> v >> u;
		v--; u--;
		to[v].push_back(u);
		ot[u].push_back(v);
	}
	cin >> S >> T;
	S--; T--;

	dist .resize(N*3, -1);
	distR.resize(N*3, -1);
	bfs();
	return 0;
}


Measured memory_bytes: 15872