#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include<bits/stdc++.h>
using namespace std;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;

const ll INF=1e18;
struct Edge{
  int to;
  ll w;
  Edge(int to,ll w):to(to),w(w){}
};
using Graph=VV<Edge>;
using pli=pair<ll,int>;
template<class T> bool chmin(T& a,T b){
  return ((a>b)?(a=b,true):(false));
}

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

  int n,m;
  cin>>n>>m;
  V<int> u(m),v(m);
  rep(i,m){
    cin>>u[i]>>v[i];
    u[i]--,v[i]--;
  }
  int k;
  cin>>k;
  V<int> A(n);
  rep(i,k){
    int a;
    cin>>a;
    a--;
    A[a]=1;
  }
  Graph G(5*n);
  rep(i,m){
    int a=u[i],b=v[i];
    rep(j,5){
      if(A[b]==0) G[a+j*n].push_back(Edge(b,1));
      else if(j<4) G[a+j*n].push_back(Edge(b+(j+1)*n,1));
      if(A[a]==0) G[b+j*n].push_back(Edge(a,1));
      else if(j<4) G[b+j*n].push_back(Edge(a+(j+1)*n,1));
    }
  }

  V<ll> dist(5*n,INF);
  int s=0;
  dist[s]=0;
  priority_queue<pli,vector<pli>,greater<pli>> que;
  que.push({dist[s],s});
  while(!que.empty()){
    int v=que.top().second;
    ll d=que.top().first;
    que.pop();
    if(d>dist[v]) continue;
    for(auto e:G[v]){
      if(chmin(dist[e.to],dist[v]+e.w)){
        que.push({dist[e.to],e.to});
      }
    }
  }
  ll ans=INF;
  rep(i,5) ans=min(ans,dist[n-1+i*n]);
  if(ans==INF) cout<<-1<<endl;
  else cout<<ans<<endl;

  return 0;
}