CF191C Fools and Roads

有一颗 $n$ 个节点的树，$k$ 次旅行，问每一条边被走过的次数。

无

无

In the first sample the fool number one goes on the first and third road and the fool number 3 goes on the second, first and fourth ones. In the second sample, the fools number 1, 3 and 5 go on the first road, the fool number 5 will go on the second road, on the third road goes the fool number 3, and on the fourth one goes fool number 1.