#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vl; typedef vector vvl; typedef vector vvvl; typedef vector vvvvl; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pl; typedef pair ppl; typedef pair pppl; typedef pair pppppl; #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 all(a) begin(a),end(a) #define sz(a) (int)(a).size() #define F first #define S second #define bs(A,x) binary_search(all(A),x) #define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin()) #define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin()) #define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x)) templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint a){os<>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;} //*/ templateostream&operator<<(ostream&os,pairp){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vectorv){rep(i,0,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} int main(){ cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); ll N,M;cin>>N>>M; vvl E(N); while(M--){ ll u,v;cin>>u>>v;u--;v--; E[u].emplace_back(v); E[v].emplace_back(u); } ll K;cin>>K; vb A(N); while(K--){ ll v;cin>>v;v--; A[v]=1; } vvl D(N,vl(5,1e18)); queueQ; Q.emplace(pl(0,0)); D[0][0]=0; while(sz(Q)){ auto[v,t]=Q.front();Q.pop(); for(auto u:E[v]){ if(t==4&&A[u])continue; if(chmin(D[u][A[u]?t+1:0],D[v][t]+1))Q.emplace(pl(u,A[u]?t+1:0)); } } ll ans=*min_element(all(D[N-1])); if(ans>1e17)ans=-1; cout<