CodeForces 707B Bakery

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 k storages, 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.

Example

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个城市， 这n个城市当中有k个面粉仓库，想要建面包房，但是面包房不能和面粉仓库建在同一个城市里，给你这个n个城市的m条路（路是双向的），问你面包房建在某个城市离面粉仓库最近的距离。

思路：只要把路径排序一下，从最小的开始读，只要满足一头是仓库，一头是面包房就行了。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
int s;
int e;
int v;
}a[100005];
int visit[100005];
int cmp(node x,node y){
return x.v < y.v;
}
int main(){
int m,n,k;
int i,b;
while(scanf("%d%d%d",&n,&m,&k)!=EOF){
  memset(visit,0,sizeof(visit));
  for(i=0;i<m;i++){
    scanf("%d%d%d",&a[i].s,&a[i].e,&a[i].v);
  }
  while(k--){
    scanf("%d",&b);
    visit[b]=1;
  }
  sort(a,a+m,cmp);
  int f=0;
for(i=0;i<m;i++){
    if(visit[a[i].s] && !visit[a[i].e] || !visit[a[i].s] && visit[a[i].e]){
        f=1;
        printf("%d\n",a[i].v);
        break;
    }
  }
  if(!f)
    printf("-1\n");
}
}