# [SPOJ COT/BZOJ 2588]COT - Count on a tree（主席树，LCA，离散化）

### Description

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

HNCJ OIer 一枚