Codeforces #368（Div.2）B.Bakery【贪心】

B. Bakery

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Masha wants to open her own bakery and bake muffins in one of the n cities numbered from 1 to n. There are m bidirectional roads, each of whose connects some pair of cities.

To bake muffins in her bakery, Masha needs to establish flour supply from some storage. There are only kstorages, located in different cities numbered a₁, a₂, ..., a_k.

Unforunately the law of the country Masha lives in prohibits opening bakery in any of the cities which has storage located in it. She can open it only in one of another n - k cities, and, of course, flour delivery should be paid — for every kilometer of path between storage and bakery Masha should pay 1 ruble.

Formally, Masha will pay x roubles, if she will open the bakery in some city b (a_i ≠ b for every 1 ≤ i ≤ k) and choose a storage in some city s (s = a_j for some 1 ≤ j ≤ k) and b and s are connected by some path of roads of summary length x (if there are more than one path, Masha is able to choose which of them should be used).

Masha is very thrifty and rational. She is interested in a city, where she can open her bakery (and choose one of k storages and one of the paths between city with bakery and city with storage) and pay minimum possible amount of rubles for flour delivery. Please help Masha find this amount.

Input

The first line of the input contains three integers n, m and k (1 ≤ n, m ≤ 10⁵, 0 ≤ k ≤ n) — the number of cities in country Masha lives in, the number of roads between them and the number of flour storages respectively.

Then m lines follow. Each of them contains three integers u, v and l (1 ≤ u, v ≤ n, 1 ≤ l ≤ 10⁹, u ≠ v) meaning that there is a road between cities u and v of length of l kilometers .

If k > 0, then the last line of the input contains k distinct integers a₁, a₂, ..., a_k (1 ≤ a_i ≤ n) — the number of cities having flour storage located in. If k = 0 then this line is not presented in the input.

Output

Print the minimum possible amount of rubles Masha should pay for flour delivery in the only line.

If the bakery can not be opened (while satisfying conditions) in any of the n cities, print  - 1 in the only line.

Examples

Input

5 4 2

1 2 5

1 2 3

2 3 4

1 4 10

1 5

Output

3

Input

3 1 1

1 2 3

3

Output

-1

题目大意：

给你n个点，m条无向边，k个仓库，让你找一个不是仓库的点，找与其距离最近的仓库，输出。

思路：

1、首先明确一点，如果对于这m条无向边，如果某条边出现了一个不是仓库的点，一个是仓库的点，那么这条无向边就是一个可行解。那么我们先将这些条边排序，按照权值从小到大排序。

2、至于为什么不用求最短路，其实想想就能明白，如果在m条边中没有出现过非仓库点，那么将仓库点取出，如何做最短路都是无用功。所以必须某条边中同时出现一个非仓库点和一个仓库点相连，才能出现从非仓库点能够到达仓库点的情况。而这条边是直接相连的边，不必要做其他非仓库点到当前仓库点的最短路，因为如何做，都不如这个直连仓库点的点距离近，所以可以贪心。

3、然后将仓库点标记进vis【】数组中，然后遍历一层for，遇到第一个可行解输出跳出，否则输出-1即可。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
    int x,y,w;
}a[1000000];
int vis[1000000];
int n,m,k;
int cmp(node a,node b)
{
    return a.w<b.w;
}
int main()
{
    while(~scanf("%d%d%d",&n,&m,&k))
    {
        memset(vis,0,sizeof(vis));
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].w);
        }
        while(k--)
        {
            int x;
            scanf("%d",&x);
            vis[x]=1;
        }
        int ans=-1;
        sort(a,a+m,cmp);
        for(int i=0;i<m;i++)
        {
            if(vis[a[i].x]==0&&vis[a[i].y]==1||vis[a[i].y]==0&&vis[a[i].x]==1)
            {
                ans=a[i].w;
                break;
            }
        }
        printf("%d\n",ans);
    }
}