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 a1, a2, ..., ak.

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 (ai ≠ b for every 1 ≤ i ≤ k) and choose a storage in some city s (s = aj 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.

</big>

##Input

<big>

The first line of the input contains three integers n, m and k (1 ≤ n, m ≤ 105, 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 ≤ 109, 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 a1, a2, ..., ak (1 ≤ ai ≤ n) — the number of cities having flour storage located in. If k = 0 then this line is not presented in the input.

</big>

##Output

<big>

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.

</big>

##Examples

<big>

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

</big>

##Source

<big>

Codeforces Round #368 (Div. 2)

</big>

<br/>

##题意：

<big>

有n个城市，其中k个地方是仓库，现在要选一个没有仓库的城市建一个商店，使得其离任一商店最近.

</big>

<br/>

##题解：

<big>

把所有直接连接仓库和其他城市的边拿出来比较一下即可.

</big>

<br/>

##代码：

``` cpp

#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <queue>

#include <map>

#include <set>

#include <stack>

#include <vector>

#include <list>

#define LL long long

#define eps 1e-8

#define maxn 101000

#define mod 100000007

#define inf 0x3f3f3f3f

#define mid(a,b) ((a+b)>>1)

#define IN freopen("in.txt","r",stdin);

using namespace std;

int n,m,k;

typedef pair<int,int> pii;

vector<pii> g[maxn];

bool store[maxn];

int main(int argc, char const *argv[])

{

    //IN;

    while(scanf("%d %d %d", &n,&m,&k) != EOF)

    {

        for(int i=1; i<=n; i++) g[i].clear();

        memset(store, 0, sizeof(store));

        while(m--) {

            int u,v,w; scanf("%d %d %d", &u,&v,&w);

            g[u].push_back(make_pair(v,w));

            g[v].push_back(make_pair(u,w));

        }

        while(k--) {

            int x; scanf("%d", &x);

            store[x] = 1;

        }

        int ans = inf;

        for(int i=1; i<=n; i++) if(store[i]) {

            int sz = g[i].size();

            for(int j=0; j<sz; j++) if(!store[g[i][j].first]){

                ans = min(ans, g[i][j].second);

            }

        }

        if(ans == inf) ans = -1;

        printf("%d\n", ans);

    }

    return 0;

}

Codeforces Round #368 (Div. 2) B. Bakery （模拟）的相关教程结束。