#include <bits/extc++.h>

using namespace std;
namespace rg = ranges;

constexpr int N = 1000000;

alignas(64) int I[N + 1], G[2 * N - 2], S[N - 1];
alignas(64) pair<int, int> E[N - 1];
alignas(64) pair<long long, long long> F[N];

int main()
{
	cin.tie(0)->sync_with_stdio(0);

	int		  n;
	long long A, B;
	cin >> n >> A >> B;
	for (int i = 0; i < n - 1; i++)
	{
		auto &[u, v] = E[i];
		cin >> u >> v;
		u--;
		v--;
		I[u]++;
		I[v]++;
	}
	if (n <= 2)
	{
		cout << "0";
		return 0;
	}
	int r = 0;
	while (I[r] == 1)
		r++;
	for (int i = 0; i < n; i++)
		I[i + 1] += I[i];
	for (int i = 0; i < n - 1; i++)
	{
		auto [u, v] = E[i];
		G[--I[u]]	= v;
		G[--I[v]]	= u;
	}

	constexpr auto diff = [](int i)
	{
		return F[i].first - F[i].second;
	};
	constexpr auto rpar = [](int u, int v)
	{
		for (int i = I[v]; i < I[v + 1] - 1; i++)
			if (G[i] == u)
			{
				G[i] = G[I[v + 1] - 1];
				break;
			}
	};

	int ss = 0;
	for (int i = I[r]; i < I[r + 1]; i++)
	{
		int v	= G[i];
		S[ss++] = v;
		rpar(r, v);
	}
	while (ss)
	{
		int v = S[--ss];
		if (v >= 0)
		{
			S[ss++] = v | INT_MIN;
			for (int i = I[v]; i < I[v + 1] - 1; i++)
			{
				int w	= G[i];
				S[ss++] = w;
				rpar(v, w);
			}
		}
		else
		{
			v &= INT_MAX;
			rg::sort(G + I[v], G + I[v + 1] - 1, {}, diff);
			long long sum = 0;
			for (int i = I[v]; i < I[v + 1] - 1; i++)
				sum += F[G[i]].second;
			F[v] = {sum, sum};
			for (int i = I[v]; i < I[v + 1] - 1; i++)
			{
				int k = i - I[v] + 1;
				sum += diff(G[i]);
				F[v].first	= min(F[v].first, sum + k / 2 * B);
				F[v].second = min(F[v].second, sum + (k + 1) / 2 * B);
			}
			F[v].second += min(A, B);
		}
	}

	long long sum = 0;
	for (int i = I[r]; i < I[r + 1]; i++)
		sum += F[G[i]].second;
	long long res = sum;
	for (int i = I[r]; i < I[r + 1]; i++)
	{
		sum += diff(G[i]);
		res = min(res, sum + (i - I[r]) / 2 * B);
	}
	cout << res;
}