#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> // using mint = modint998244353; template void debug(T e) { cerr << e << endl; } template void debug(vector& v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector>& v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector>& v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set& st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset& ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map& mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint1000000007; void debug_mint1(vector& vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector>& vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } int main() { ll N, M; cin >> N >> M; vector U(M); vector V(M); for (ll i = 0; i < M; i++) { cin >> U[i] >> V[i]; U[i]--; V[i]--; } ll K; cin >> K; vector A(K); for (ll i = 0; i < K; i++) { cin >> A[i]; } vector has(N, false); for (ll i = 0; i < K; i++) { has[A[i] - 1] = true; } ll INF = 100000000000023; vector> dist(N, vector(5, INF)); dist[0][0] = 0; queue que; que.push(make_pair(0, 0)); vector graph(N, vector(0)); for (ll i = 0; i < M; i++) { graph[U[i]].push_back(V[i]); graph[V[i]].push_back(U[i]); } while (que.size()) { pll p = que.front(); que.pop(); for (ll x : graph[p.first]) { if (has[x]) { if (p.second == 4) { continue; } if (dist[x][p.second + 1] == INF) { dist[x][p.second + 1] = dist[p.first][p.second] + 1; que.push(make_pair(x, p.second + 1)); } } else { if (dist[x][0] == INF) { dist[x][0] = dist[p.first][p.second] + 1; que.push(make_pair(x, 0)); } } } } ll ans = INF; for (ll i = 0; i < 5; i++) { ans = min(ans, dist[N - 1][i]); } // debug(dist); cout << (ans == INF ? -1 : ans) << endl; }