Time Travel
Contest: Codeforces Round 905 (Div. 1)
Difficulty rating: 1900
Tags: binary search, graphs, shortest paths

Berland is a country with ancient history, where roads were built and destroyed for centuries. It is known that there always were $$$n$$$ cities in Berland. You also have records of $$$t$$$ key moments in the history of the country, numbered from $$$1$$$ to $$$t$$$. Each record contains a list of bidirectional roads between some pairs of cities, which could be used for travel in Berland at a specific moment in time.

You have discovered a time machine that transports you between key moments. Unfortunately, you cannot choose what point in time to end up at, but you know the order consisting of $$$k$$$ moments in time $$$a_{i}$$$, in which the machine will transport you. Since there is little time between the travels, when you find yourself in the next key moment in time (including after the last time travel), you can travel on at most one existing road at that moment, coming out from the city you were in before time travel.

Currently, you are in city $$$1$$$, and the time machine has already transported you to moment $$$a_{1}$$$. You want to reach city $$$n$$$ as quickly as possible. Determine the minimum number of time travels, including the first one, that you need to make in order to reach city $$$n$$$.

Input format:
The first line contains two integers $$$n$$$ and $$$t$$$ ($$$2 \le n \le 2 \cdot 10^5, 1 \le t \le 2 \cdot 10^5$$$) — the number of cities in Berland and the number of records about key moments in history. Then follows the description of each of the $$$t$$$ records.

The first line of each record description contains a single integer $$$m_{i}$$$ ($$$0 \le m_{i} \le \min \left(\frac{n(n-1)}{2}, 2 \cdot 10^5\right)$$$) — the number of roads in the $$$i$$$-th record.

Each of the next $$$m_i$$$ lines contains two integers $$$v_{j}$$$ and $$$u_{j}$$$ ($$$1 \le v_{j}, u_{j} \le n$$$, $$$v_{j} \neq u_{j}$$$) — the numbers of cities connected by the $$$j$$$-th road in the $$$i$$$-th key moment in history.

The next line contains a single integer $$$k$$$ ($$$1 \le k \le 2 \cdot 10^5$$$) — the number of time moments between which movements will occur.

The next line contains $$$k$$$ integers $$$a_1, a_2, \ldots, a_k$$$ ($$$1 \le a_{i} \le t$$$) — the time moments at which you will be after each movement.

It is guaranteed that the sum of $$$m_{i}$$$ does not exceed $$$2 \cdot 10^5$$$. It is guaranteed that each unordered pair $$$(u, v)$$$ occurs in the road description for one record no more than once.

Output format:
Output a single integer — the minimum number of time travels required to reach city $$$n$$$ from city $$$1$$$, or $$$-1$$$ if it is impossible.

Note that movement to time moment $$$a_{1}$$$ is also considered a movement.

Constraints:
Time limit: 2.0 s
Memory limit: 512.0 MB

Note:
In the first example, you are in city $$$1$$$ and move to moment $$$a_{1} = 2$$$. Since there are no suitable roads to pass, you do nothing and move to moment $$$a_{2} = 1$$$, after which you travel along the road $$$(1, 2)$$$. Moving to moment $$$a_{3} = 2$$$, you travel along the road $$$(2, 3)$$$. Moving to moment $$$a_{4} = 1$$$, you stay in city $$$3$$$ and make the next time travel. At time moment $$$a_{5} = 2$$$, you travel along the road $$$(3, 5)$$$ and end up in the final city after $$$5$$$ time travels.

In the second example, it can be shown that it is impossible to reach city $$$5$$$ with the given time travels.

Example input:
5 2
4
1 2
2 3
3 4
4 5
2
2 3
3 5
6
2 1 2 1 2 1

Example output:
5

Example input:
5 2
3
1 2
3 1
4 3
2
2 1
4 5
5
1 2 1 1 1

Example output:
-1

Editorial:
Let $$$d_{v}$$$ denote the minimum number of moves required to reach vertex $$$v$$$. Initially, $$$d_{v} = \infty$$$ for all vertices except $$$1$$$, where $$$d_{1} = 0$$$. We will gradually mark the vertices for which we know the optimal answer. Similar to Dijkstra's algorithm, at each iteration, we will select the vertex $$$v$$$ with the minimum value of $$$d_{v}$$$ among the unmarked vertices. We will mark it and relax its neighbors: let $$$(v, u)$$$ be an edge belonging to record $$$x$$$, we will find the minimum index $$$i$$$ such that $$$d_{v} < i$$$ and $$$a_{i} = x$$$, then $$$d_{u} = \min(d_{u}, i)$$$. We can find $$$i$$$ using binary search, by saving the indices of occurrences in $$$a$$$ for each time moments. The time complexity of the solution is $$$O(m (\log k + \log n))$$$.