ACM Contest and Blackout

题意翻译

给定T组数据 每组数据n个点，m条边 求每组数据的最小生成树和非严格次小生成树

题目描述

[problemUrl]: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=18&page=show_problem&problem=1541 [PDF](https://uva.onlinejudge.org/external/106/p10600.pdf) ![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA10600/48481404a7b3f81dccbd5feb77a8dfbaff266477.png)

输入输出格式

输入格式


![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA10600/20463ee6c260b6122e0fb359137cb747259bf295.png)

输出格式


![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA10600/694aafbbaca63beb5858afc61f4299804e161093.png)

输入输出样例

输入样例 #1

2
5 8
1 3 75
3 4 51
2 4 19
3 2 95
2 5 42
5 4 31
1 2 9
3 5 66
9 14
1 2 4
1 8 8
2 8 11
3 2 8
8 9 7
8 7 1
7 9 6
9 3 2
3 4 7
3 6 4
7 6 2
4 6 14
4 5 9
5 6 10

输出样例 #1

110 121
37 37