Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

dfs and similar

dp

graph matchings

greedy

trees

*2200

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Hamiltonian Spanning Tree

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA group of *n* cities is connected by a network of roads. There is an undirected road between every pair of cities, so there are roads in total. It takes exactly *y* seconds to traverse any single road.

A spanning tree is a set of roads containing exactly *n* - 1 roads such that it's possible to travel between any two cities using only these roads.

Some spanning tree of the initial network was chosen. For every road in this tree the time one needs to traverse this road was changed from *y* to *x* seconds. Note that it's not guaranteed that *x* is smaller than *y*.

You would like to travel through all the cities using the shortest path possible. Given *n*, *x*, *y* and a description of the spanning tree that was chosen, find the cost of the shortest path that starts in any city, ends in any city and visits all cities exactly once.

Input

The first line of the input contains three integers *n*, *x* and *y* (2 ≤ *n* ≤ 200 000, 1 ≤ *x*, *y* ≤ 10^{9}).

Each of the next *n* - 1 lines contains a description of a road in the spanning tree. The *i*-th of these lines contains two integers *u*_{i} and *v*_{i} (1 ≤ *u*_{i}, *v*_{i} ≤ *n*) — indices of the cities connected by the *i*-th road. It is guaranteed that these roads form a spanning tree.

Output

Print a single integer — the minimum number of seconds one needs to spend in order to visit all the cities exactly once.

Examples

Input

5 2 3

1 2

1 3

3 4

5 3

Output

9

Input

5 3 2

1 2

1 3

3 4

5 3

Output

8

Note

In the first sample, roads of the spanning tree have cost 2, while other roads have cost 3. One example of an optimal path is .

In the second sample, we have the same spanning tree, but roads in the spanning tree cost 3, while other roads cost 2. One example of an optimal path is .

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/04/2023 10:16:29 (l2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|