The kingdom of Hellcife has several cities that are connected by some roads. One day, the king of Hellcife, Bair Jolsonaro, decided to set fire on some of these cities, just for fun. It's known that the ii-th city has a number TiTi, indicating that if the fire reaches that city at time XX, then at time X+TiX+Ti this city will be completely burnt. After a city is completely burnt, the fire begins to spread across all the roads that are connected to this city, with speed of one meter per second.
Your task is simple: you have to find, for each city, the amount of time it takes for the city to be completely burnt, knowing that at time 0 the king Bair Jolsonaro set fire on some cities.
Input
The first line of input contains three numbers NN, MM and KK (1≤N,M,K≤1051≤N,M,K≤105), indicating the number of cities in Hellcife, the number of roads in Hellcife, and the number of cities Bair Jolsonaro initially set fire, respectively.
Each of the following MM lines contains three integers AiAi, BiBi, and CiCi (1≤Ai,Bi≤N1≤Ai,Bi≤N, Ai≠BiAi≠Bi, 1≤Ci≤1051≤Ci≤105), indicating that there is a road between cities AiAi and BiBi with length of CiCi meters.
The next line of input contains NN numbers TiTi (1≤i≤N1≤i≤N, 1≤Ti≤1051≤Ti≤105).
The last line of the input contains KK numbers XiXi (1≤i≤K1≤i≤K, 1≤Xi≤N1≤Xi≤N), indicating that the XiXi-th city was chosen by Bair Jolsonaro to be set on fire in the beginning.
Output
The output consists of NN lines, the ii-th of them indicates the amount of time it takes for the ii-th city to be completely burnt.
Examples
Input
5 5 1
1 2 1
2 3 4
3 4 5
4 5 10
1 5 13
1 2 3 4 5
1
Output
1
4
11
20
19
Input
5 18 1
1 3 14877
2 1 81271
1 2 50743
5 1 46485
2 5 41563
5 4 72606
1 2 88401
5 3 56633
2 1 25722
3 1 78857
2 3 95527
5 4 66046
1 4 87400
4 2 49102
3 2 3043
5 3 32836
3 2 13703
4 1 86008
31551 94560 84171 16742 55756
2
Output
151833
94560
181774
160404
191879
Input
7 12 2
6 3 61451
3 5 48225
3 6 18732
5 3 86896
1 5 73979
4 3 49294
3 1 2794
1 5 3449
7 2 86351
4 6 59862
2 1 38972
3 7 20293
36685 6614 81280 91835 68491 81662 10505
2 1
Output
36685
6614
120759
261888
108625
221153
103470
Note
It is guaranteed that from any city you can reach any other city using some roads.
题意:n个城市,m条路径,k个源点;每个城市都会有一个a【i】记录该城市燃烧完所花费的时间,问1-n这些城市什么时候完全烧尽。
思路:多起点dijstra,注意dijstra只能走一遍(k遍会超时),建立一个边0->x;w=0;走0就可以了。