Jzzhu is the president of country A. There are $n$ cities numbered from $1$ to $n$ in his country. City $1$ is the capital of A. Also there are $m$ roads connecting the cities. One can go from city $u_i$ to $v_i$ (and vise versa) using the $i$-th road, the length of this road is $x_i$. Finally, there are $k$ train routes in the country. One can use the $i$-th train route to go from capital of the country to city $s_i$ (and vise versa), the length of this route is $y_i$.

The first line contains three integers $n,m,k\ (2 ≤n≤ 10^5;\ 1 ≤m≤ 3·10^5;\ 1 ≤k≤ 10^5)$.
Each of the next $m$ lines contains three integers $u_i,v_i,x_i\ (1 ≤u_i,v_i≤n;\ u_i≠v_i;\ 1 ≤x_i≤ 10^9)$.
Each of the next $k$ lines contains two integers $s_i, y_i\ (2 ≤s_i≤n;\ 1 ≤y_i≤ 10^9)$.
It is guaranteed that there is at least one way from every city to the capital. Note, that there can be multiple roads between two cities. Also, there can be multiple routes going to the same city from the capital.

Output a single integer representing the maximum number of the train routes which can be closed.