PROGRAMMING:Xiaoyu's food and grass

Now Xiaoyu has a map with $$n $$supply points and $$M $$roads
Give the starting point and ending point of the $$M $$Road, and the cost of food and grass to complete the road
Now Xiaoyu has $$k $$queries. Each query gives a starting point $$a $$and an end point $$B $$. Xiaoyu wants to know what is the minimum value of the longest edge in all the paths from $$a $$to $$B $$
###Input format:
The first line gives three positive integers, $$n, $$m, $$k $$, which means there are $$n $$supply points, $$M $$roads and $$k $$queries
Next, $$M $$line gives three positive integers, $$a $, $$B $, $$C $$, indicating the starting point, end point and cost of the road. $$1 $$< = $$a $, $$B $$< = $$n $$, $$1 $$< = $$C $$< = $$1e9$$
Finally, $$k $$line, each line gives two positive integers, $$a $, $$B $$, which means to ask what is the minimum value of the longest edge in all the paths from $$a $$to $$B $$
$$1$$<=$$n$$<=$$15000$$,$$1$$<=$$m$$<=$$30000$$,$$1$$<=$$k$$<=$$20000$$.
###Output format:
For each query, output the answer
###Input example:
Here is a set of inputs. For example:
```in
3 2 1
1 2 1
2 3 2
1 3
```
###Output example:
The corresponding output is given here. For example:
```out
two
```







answer：If there is no answer, please comment