Description

Country J has $n$ cities, connected by $m$ one-way roads. The length of each road is known.

One day, Rainbow, who lives in Country J, invites Vani to visit. However, as an experienced traveler, Vani is only interested in $k$ cities in Country J that have a long history and unique natural scenery.
To improve the travel experience, Vani wants to know the minimum value among the “pairwise shortest paths” between the cities he is interested in (that is, among all pairs of cities he is interested in, the shortest-path distance of the closest pair).

You may have already guessed the story — Vani will be busy traveling elsewhere these days, so please help him solve this problem.

Input Format

Each test point contains multiple test cases. The first line is an integer $T$, the number of test cases. Note that the test cases are independent of each other.

For each test case, the first line contains three positive integers $n, m, k$, representing $n$ cities in Country J (numbered from $1 \sim n$), $m$ roads, and the number $k$ of cities that Vani is interested in.

The next $m$ lines each contain $3$ positive integers $x, y, z$, indicating that there is a one-way road from city $x$ to city $y$ with length $z$. Note that $x$ and $y$ may be equal, and the same pair $(x, y)$ may appear multiple times.

The next line contains $k$ positive integers, the indices of the cities that Vani is interested in.

Output Format

The output should contain $T$ lines. For each test case, output one integer: the minimum value among the pairwise shortest-path distances between the $k$ cities.

2
6 7 3
1 5 3
2 3 5
1 4 3
5 3 2
4 6 5
4 3 7
5 6 4
1 3 6
7 7 4
5 3 10
6 2 7
1 2 6
5 4 2
4 3 4
1 7 3
7 2 4
1 2 5 3

5
6

Hint

Sample Explanation

For the first test case, the shortest path from $1$ to $3$ is $5$; from $1$ to $6$ is $7$; $3$ and $6$ cannot reach each other. So the closest pair is $1, 3$, and the minimum distance is $5$.

For the second test case, the shortest path from $1$ to $2$ is $6$; from $5$ to $3$ is $6$; all other pairs of points cannot reach each other. So the closest pairs are $1, 2$ and $5, 3$, and the minimum distance is $6$.

Constraints

$2 \le k \le n$, $1 \le x, y \le n$, $1 \le z \le 2 \times 10^9$, $T \leq 5$.

Admin note on 2024-12-18: There may be self-loops in test point 5。

Translated by ChatGPT 5