COT  Count on a tree
You are given a tree with N nodes. The tree nodes are numbered from 1 to N. Each node has an integer weight.
We will ask you to perform the following operation:
 u v k : ask for the kth minimum weight on the path from node u to node v
Input
In the first line there are two integers N and M. (N, M <= 100000)
In the second line there are N integers. The ith integer denotes the weight of the ith node.
In the next N1 lines, each line contains two integers u v, which describes an edge (u, v).
In the next M lines, each line contains three integers u v k, which means an operation asking for the kth minimum weight on the path from node u to node v.
Output
For each operation, print its result.
Example
Input: 8 5 105 2 9 3 8 5 7 7 1 2 1 3 1 4 3 5 3 6 3 7 4 8
2 5 1
2 5 2
2 5 3
2 5 4
7 8 2
Output: 2
8
9
105
7
hide comments
mhasan01:
20200714 04:47:11
Finally got Accepted :')


grey_rabb1t:
20200129 08:31:56
hentai


sclchuck:
20190801 04:09:56
17 10


wzw1105:
20190501 08:27:06
the data u v in the input don't guarantee that u is the father of v 

zhanibek_02:
20190306 14:30:19
I have no idea about it, how can I solve it? 

cichipi_:
20181012 04:35:43
Not specifying w range is stupid :) Last edit: 20181012 13:35:56 

wolf3h2h2:
20180614 01:48:19
the abslute value of the weights can be > 1e9 Last edit: 20180614 02:24:21 

VilimL:
20180324 11:59:31
Please add new languages. 

thedark:
20170818 10:03:49
wtf n is not <= 1e5, wasted too much time, take limit of n 111111 to be on safe side..


darkghostnj:
20170726 22:05:16
the weights can be negative or bigger then 10^5 and that is why most people get WA on this problem 
Added by:  Fotile 
Date:  20120214 
Time limit:  1s 
Source limit:  6000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM32GCC ASM64 MAWK BC CCLANG CPP14 CPP14CLANG COBOL COFFEE DCLANG DDMD DART ELIXIR FANTOM FORTH GOSU GRV JSMONKEY KTLN NIM NODEJS OBJC OBJCCLANG OCT PICO PROLOG PYPY PY_NBC R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET 
Resource:  Just for fun... 