Hdu 2680-Choose the best route

题目链接：
传送门

Problem Description：
One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city’s traffic route, and the stations which are near Kiki’s home so that she can take. You may suppose Kiki can change the bus at any station. Please find out the least time Kiki needs to spend. To make it easy, if the city have n bus stations ,the stations will been expressed as an integer 1,2,3…n.

Input：
There are several test cases.
Each case begins with three integers n, m and s,(n<1000,m<20000,1=<s<=n) n stands for the number of bus stations in this city and m stands for the number of directed ways between bus stations .(Maybe there are several ways between two bus stations .) s stands for the bus station that near Kiki’s friend’s home.
Then follow m lines ,each line contains three integers p , q , t (0<t<=1000). means from station p to station q there is a way and it will costs t minutes .
Then a line with an integer w(0<w<n), means the number of stations Kiki can take at the beginning. Then follows w integers stands for these stations.

Output：
The output contains one line for each data set : the least time Kiki needs to spend ,if it’s impossible to find such a route ,just output “-1”.

Sample Input：
5 8 5
1 2 2
1 5 3
1 3 4
2 4 7
2 5 6
2 3 5
3 5 1
4 5 1
2
2 3
4 3 4
1 2 3
1 3 4
2 3 2
1
1

Sample Output：
1
-1

中文版本：
题目描述：
一天，Kiki想要拜访她其中的一个朋友。由于她容易晕车，她想尽快到达她朋友家。现在给你一张城市交通路线的地图，以及Kiki家附近的车站，这样她就可以去乘车。你可以认为Kiki可以在任何一站换车。请找出Kiki最少需要花费的时间。为了方便起见，如果城市有n个公交车站，这些车站将被表示为一个整数1、2、3…n。

输入：
有几个测试样例。每个样例始于3个整数n，m和s（n＜1000，m＜20000,1≤s≤n）
n代表了在这个城市的公交车数量，m代表了在两个公交车站之间直达的路的数量。（可能在两个公交车站之间有数条路），s代表了在Kiki朋友家附近的公交车站。
接下来跟着m行，每一行包含了3个整数p，q，t（0＜t≤1000），意味着从p站到q站有一条路，它需要花费t分钟。
接着的一行带有一个整数w（0＜w＜n），意味着 一开始Kiki能乘车的车站数，然后是w个代表这些车站的整数。

输出：
输出为每个包含一行的数据集：Kiki需要花费最少的时间，如果不能找到这样的路径，输出“-1”。

样例输入：
5 8 5
1 2 2
1 5 3
1 3 4
2 4 7
2 5 6
2 3 5
3 5 1
4 5 1
2
2 3
4 3 4
1 2 3
1 3 4
2 3 2
1
1

样例输出：
1
-1

样例示意图：