#include "bits/stdc++.h"

using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

#define int long long
#define ll long long
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>istream &operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
//template <typename T, typename S>ostream &operator<<(ostream &os, pair<T, S> &p) {os << p.first << " " << p.second;return os;}

template <typename T> void printvv(const vector<vector<T>> &v) {
	cerr << endl;
	rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
		if (typeid(v[i][j]).name() == typeid(INF).name() and v[i][j] == INF) {
			cerr << "INF";
		}
		else
			cerr << v[i][j];
		cerr << (j == v[i].size() - 1 ? '\n' : ' ');
	}
	cerr << endl;
}

#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
template <class T, class U>bool chmin(T& a, U b) { if (a > b) { a = b; return true; }return false; }
template <class T, class U>bool chmax(T& a, U b) { if (a < b) { a = b; return true; }return false; }
using Weight = int;
using Flow = int;
struct Edge {
	int s, d; Weight w; Flow c;
	Edge() {};
	Edge(int s, int d, Weight w = 1) : s(s), d(d), w(w), c(w) {};
};
bool operator<(const Edge &e1, const Edge &e2) { return e1.w < e2.w; }
bool operator>(const Edge &e1, const Edge &e2) { return e2 < e1; }
inline ostream &operator<<(ostream &os, const Edge &e) { return (os << '(' << e.s << ", " << e.d << ", " << e.w << ')'); }

using Edges = vector<Edge>;
using Graph = vector<Edges>;
using Array = vector<Weight>;
using Matrix = vector<Array>;

void addArc(Graph &g, int s, int d, Weight w = 1) {
	g[s].emplace_back(s, d, w);
}
void addEdge(Graph &g, int a, int b, Weight w = 1) {
	addArc(g, a, b, w);
	addArc(g, b, a, w);
}

//単一始点最短経路(負閉路なし)
//Dijkstra O((|E|+|V|)log|V|)
//dist: 始点から各頂点までの最短距離
//戻り値: 最短経路木の親頂点(根は-1)
void dijkstra(const Graph &g, int s, int t) {
	int n = g.size();
	assert(s < n);
	enum { WHITE, GRAY, BLACK };
	//vector<int> color(n, WHITE); color[s] = GRAY;
	vector<vector<int>>color(n, vector<int>(3, WHITE));
	vector<vector<int>>dist(n, vector<int>(3, INF));
	color[s][0] = GRAY;
	dist[s][0] = 0;
	using State = tuple<Weight, int, int>; //始点からの最短距離
	priority_queue<State, vector<State>, greater<State>> pq;
	pq.emplace(0, s, 0);
	while (pq.size()) {
		Weight d; int v, u;
		tie(d, v, u) = pq.top();
		pq.pop();
		if (dist[v][u] < d)continue;
		color[v][u] = BLACK;
		for (auto &e : g[v]) {
			int x = (u + 1) % 3;
			if (color[e.d][(u + 1) % 3] == BLACK)continue;
			if (dist[e.d][(u + 1) % 3] > dist[v][u] + e.w) {
				dist[e.d][(u + 1) % 3] = dist[v][u] + e.w;
				pq.emplace(dist[e.d][x], e.d, x);
				color[e.d][(u + 1) % 3] = GRAY;
			}
		}
	}

	int ans = dist[t][0];
	if (ans == INF) {
		cout << -1 << endl;
	}
	else {
		assert(ans % 3 == 0);
		cout << ans / 3 << endl;
	}
}


signed main(signed argc, char *argv[]) {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(12);

	int N, M; cin >> N >> M;
	Graph g(N);
	rep(i, 0, M) {
		int u, v; cin >> u >> v;
		u--, v--;
		addArc(g, u, v);
	}
	int s, t; cin >> s >> t;
	s--, t--;
	dijkstra(g, s, t);

	return 0;
}


Measured memory_bytes: 18176