#include<bits/stdc++.h>
using namespace std;
typedef array<int, 3> xyz;
int main()
{
	int n, m;
	cin >> n >> m;
	vector<vector<int>> g(n);
	for(int i = 0; i<m;i++){
		int u, v;cin >> u>>v;
		g[--u].push_back(--v);
		g[v].push_back(u);
	}
	int k;
	cin >> k;
	vector<bool> yiwiy9(n, false);
	for(int i = 0;i<k;i++){
		int v;cin>>v;yiwiy9[--v] = 1;}
	vector<vector<int>> dist(n, vector<int>(6, 998244353));
	priority_queue<xyz, vector<xyz>, greater<xyz>> pq;
	pq.push(xyz{0, 0, 0});
	dist[0][0] = 0;
	while(!pq.empty())
	{
		auto [c, vs, cnt] = pq.top();
		pq.pop();
		for(int v : g[vs])
		{
			int nxt = cnt+1;
			if(!yiwiy9[v]) nxt = 0;
			if(nxt >= 5)continue;
			if(dist[v][nxt]>c+1)
			{
				dist[v][nxt] = c+1;
				pq.push(xyz{c+1, v, nxt});
			}
		}
	}
	cout << (dist[n-1][0]==998244353?-1:dist[n-1][0]);
}