Problem F
George
Last week Mister George visited Croatia. Since Mister George is a very important person, while he was in a street, the police disallowed entry to that street, but vehicles that entered the street before Mister George could continue driving.
While Mister George was visiting, Luka drove his truck around town. But because of some of the streets being closed off, he couldn’t make his delivery in time and almost lost his job. Although it is late now, he is wondering how he could have planned his delivery better, i.e., what would have been the least time needed to make his delivery while Mister George was visiting. He knows the route mister George took.
The city is modeled with intersections and twoway streets connecting them. For each street, Luka knows how much time he needs to traverse it (mister George needs the same amount of time).
For example, if Mister George starts traversing a street during minute 10 and needs 5 minutes to exit it, this street will be blocked during minutes 10, 11, 12, 13 and 14. Luka can enter the street during minutes 9 and earlier, or 15 and later. If Luka arrives during minutes 1014, he has can wait at the intersection until minute 15 and then enter the street.
Write a program that calculates the least amount of time Luka needs to make his delivery, if he starts driving $K$ minutes after the arrival of Mister George.
Input
The first line contains two integers $N$ and $M$ ($2 \le N \le 1\, 000$, $2 \le M \le 10\, 000$), the number of intersections and the number of streets. The intersections are numbered $1$ to $N$.
The second line contains four integers $A$, $B$, $K$ and $G$ ($1 \le A, B \le N$, $0 \le K \le 2000$, $0 \le G \le 1000$). These are, in order:

The intersection where Luka starts;

The intersection Luka must get to;

The difference in starting times between mister George and Luka (Luka starts at intersection $A$ exactly $K$ minutes after mister George starts his route);

The number of intersections on Mister George’s route.
The third line contains $G$ integers, the labels of intersections mister George will visit. Every pair of adjacent integers denotes a street he will traverse. That street will exist and Mister George will traverse every street at most once.
Each of the following $M$ lines contains three integers $A$, $B$ and $L$, meaning that there is a street between intersection $A$ and $B$, and it takes $L$ minutes to traverse. $L$ will be between 1 and 1000.
Output
Output the least amount of time (in minutes) Luka needs to make his delivery.
Sample Input 1  Sample Output 1 

6 5 1 6 20 4 5 3 2 4 1 2 2 2 3 8 2 4 3 3 6 10 3 5 15 
21 
Sample Input 2  Sample Output 2 

8 9 1 5 5 5 1 2 3 4 5 1 2 8 2 7 4 2 3 10 6 7 40 3 6 5 6 8 3 4 8 4 4 5 5 3 4 23 
40 