cf17B 建树，使得边之和最小 (水题)

要建立一颗树，使得树的边sum最小，同时判断是否能生成一颗树..

Nick's company employed n people. Now Nick needs to build a tree hierarchy of «supervisor-surbodinate» relations in the company (this is to say that each employee, except one, has exactly one supervisor). There are m applications written in the following form: «employeea_i is ready to become a supervisor of employee b_i at extra cost c_i». The qualification q_j of each employee is known, and for each application the following is true: q_ai > q_bi.

Would you help Nick calculate the minimum cost of such a hierarchy, or find out that it is impossible to build it.

Input

The f