The Greed Island consists of N cities and M bidirectional roads. Gon starts his quest at city 1 and has to reach city N by travelling the shortest amount of distance. But there is a catch, he must visit K special cities before reaching the city N. Since he is not very good at such calculations, he asked Killua and you to help him figure out the shortest amount of distance to traveled.

INPUT:
The first line contains two integers N and M.
Next M lines contain three integers each $u, v, c$ describing a bidirectional road between u and v and distance c.
Next line contains an integer K.
Next line contains K space separated integers $A[i], 1\leq i \leq K$, the cities which must be visited before reaching city N.

CONSTRAINTS:
$1\leq N\leq 200$
$1\leq M\leq 500$
$1\leq K\leq 10$

OUTPUT:
The shortest distance traveled to reach city N.