Problem E
Escape Plan

BaoBao, one of the most famous monster hunters, wakes up in the middle of Heltion City dominated by monsters. Having troubles remembering what has happened, BaoBao decides to escape from this horrible city as soon as possible. Despite having no weapon, he luckily puts his hand on a map in his right pocket, which contains valuable information that can possibly help him find a way out.

According to the map, Heltion City is composed of $n$ spots connected by $m$ undirected paths. Starting from spot $1$, BaoBao must head towards any of the $k$ exits of the city to escape where the $i$-th exit is located at spot $e_ i$.

However, it’s not an easy task for BaoBao to escape since monsters are everywhere in the city! For all $1 \le i \le n$, $d_ i$ monsters are wandering near the $i$-th spot, so right after BaoBao arrives at that spot, at most $d_ i$ paths connecting the spot will be blocked by monsters and are unable for BaoBao to pass. When BaoBao leaves the $i$-th spot, the monsters will go back to their nests and the blocked paths are clear. Of course, if BaoBao comes back to the spot, at most $d_ i$ paths will be again blocked by the monsters. The paths blocked each time may differ.

As BaoBao doesn’t know which paths will be blocked, please help him calculate the shortest time he can escape from the city in the worst case.

Input

There are multiple test cases. The first line of the input contains an integer $T$ (at most $100$), indicating the number of test cases. For each test case:

The first line contains three integers $n$, $m$ and $k$ ($1 \le n \le 10^5$, $1 \le m \le 10^6$, $1 \le k \le n$), indicating the number of spots, the number of undirected paths and the number of exits from the city.

The second line contains $k$ distinct integers $e_1, e_2, \dots , e_ k$ ($1 \le e_ i \le n$), indicating $k$ exits of Heltion City.

The third line contains $n$ integers $d_1, d_2, \dots , d_ n$ ($0 \le d_ i \le m$), where $d_ i$ indicates the number of monsters at the $i$-th spot.

For the following $m$ lines, the $i$-th line contains three integers $x_ i$, $y_ i$ and $w_ i$ ($1 \le x_ i,y_ i \le n$, $x_ i \neq y_ i$, $1 \le w_ i \le 10^4$), indicating an undirected edge of length $w_ i$ connecting spot $x_ i$ and $y_ i$.

It’s guaranteed that the total sum of $n$ will not exceed $10^6$ and the total sum of $m$ will not exceed $3 \times 10^6$.

Output

For each case output one line containing one integer. If BaoBao can get to some exit in the worst case, output the shortest possible time cost; Otherwise if BaoBao cannot get to any exit in the worst case, output “-1” (without quotes) instead.

2
3 4 1
3
1 1 1
1 2 1
1 2 2
2 3 1
2 3 2
3 2 2
2 3
2 0 0
1 2 1
1 3 1

4
-1