B'You are managing a mobile phone network, and want to offer competitive prices to connect a network. The network has n nodes. Your competitor has already offered some connections between some nodes, with some fixed prices. These connections are bidirectional. There are initially m connections the competitor is offering. The i -th connection your competitor is offering will connect nodes fa_i and fb_i and costs fw_i . You have a list of k connections that you want to offer. It is guaranteed that this set of connection does not form any cycle. The j -th of these connections will connect nodes ga_j and gb_j . These connections are also bidirectional. The cost of these connections have not been decided yet. You can set the prices of these connections to any arbitrary integer value. These prices are set independently for each connection. After setting the prices, the customer will choose such n - 1 connections that all nodes are connected in a single network and the total cost of chosen connections is minimum possible. If there are multiple ways to choose such networks, the customer will choose an arbitrary one that also maximizes the number of your connections in it. You want to set prices in such a way such that all your k connections are chosen by the customer, and the sum of prices of your connections is maximized. Print the maximum profit you can achieve, or -1 if it is unbounded. The first line of input will contain three integers n , k and m ( 1 <= q n, k, m <= q 5 cdot 10^5, k <= q n-1 ), the number of nodes, the number of your connections, and the number of competitor connections, respectively. The next k lines contain two integers ga_i and gb_i ( 1 <= q ga_i, gb_i <= q n , ga_i not= gb_i ), representing one of your connections between nodes ga_i and gb_i . Your set of connections is guaranteed to be acyclic. The next $'...