CSTREET - Cobbled streets

The municipal chronicals of an unbelievable lordly major town in a land far, far away tell the following story:
Once upon a time the new crowned king Günther decided to visit all towns in his kingdom. The people of the unbelievable lordly major town expected that king Günther would like to see some of the most famous buildings in their town. For the lordly citizens it seemed neccessary that all streets in the town that the king would have to use had to be cobbled with stone. Unfortunately the unbelievable lordly major town had not much money at that time as they used most of their savings to erect the highest cathedral the world had ever seen.
Roumours were afloat that the real reason for their thriftiness was not that the town treasury was empty but that many people believed that king Günther came to the throne by deceiving his father king Erwin and that in his youth he made a pact with the devil. But anyway, the citizens of the unbelievable lordly major town decided to pave only as much streets as were absolutely necessary to reach every major building.
Can you help the citizens of the unbelievable lordly major town to find out which streets should be paved?
It might be usefull to know that all major buildings are either at the end of a street or at an intersection. In addition to that you can assume that all buildings are connected by the given streets.

Input

t [number of testcases (1 <= t <= 100)]
p [price to pave one furlong of street (positive integer)]
n [number of main buildings in the town (1 <= n <= 1000)]
m [number of streets in the town (1 <= m <= 300000)]
a b c [street from building a to building b with length c (lengths are given in furlong and the buildings are numbered from 1 to n)]

Output

For each testcase output the price of the cheapest possibility to reach all main buildings in the city on paved streets. You can assume that the result will be smaller than 2^32.

Example

Input:
1
2
5
7
1 2 1
2 3 2
2 4 6
5 2 1
5 1 3
4 5 2
3 4 3

Output:
12

Added by:Simon
Date:2005-05-24
Time limit:15s
Source limit:32211B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL GOSU JS-RHINO PERL6
Resource:Ulm Algorithm Course SoSe 2005

hide comments
2016-12-24 11:50:05
Yeah. That's right @kshubham02 !!
And add to that, in central perk, he went bald-headed(actually blonde) and fell in love with rachel :p
2016-11-28 09:28:50
easy with Kruskal :))
2016-09-24 23:12:17
I have used the kruskal + disjointset(union find with rank and path compression algo ). Normal test case passes but gives runtime error when final submission in the ladderboard.where is the problem? Please help

Last edit: 2016-09-24 23:13:17
2016-08-21 15:42:36
prims worked for me... ac in 0.04 :D
2016-07-31 20:13:03
Was avoiding learning the Disjoint-set for a long time. Happy, I finally learnt it and with Kruskal's algo got AC in 1 go.
2016-07-21 08:53:56 Punit Bhatt
1st mst problem. Accepted in 1st go @ 0.04s. Kruskal + union/find
2016-07-03 04:17:25
AC in one go.,:)
2016-06-20 23:21:44
A few hundred years later, King Gunther, who could not be killed because of his pact with the Devil, went bankrupt and ended up serving coffee in Central Perk.
2016-06-02 20:50:36
use O(V^2) prim as n<=1000. : very easy to implement
2016-06-02 14:15:49
Can someone please give some test cases. I am using mst and getting WA..
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.