#pragma GCC optimize(3, "Ofast", "unroll-loops", "-funroll-loops")
#include<bits/stdc++.h>
using namespace std;

using i32 = int;
using i64 = long long;
using i128 = __int128;
using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = unsigned __int128;

main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);

  i32 n;
  i64 A, B;
  cin >> n >> A >> B;
  vector<vector<i32>> ed(n + 1);
  for (i32 _ = 1; _ < n; _++) {
    i32 u, v;
    cin >> u >> v;
    ed[u].emplace_back(v);
    ed[v].emplace_back(u);
  }

  vector<i32> dep(n + 1), son(n + 1), mson(n + 1);
  i32 rt = -1, md = -1;

  auto dfs = [&](auto &&self, i32 u, i32 fa) -> void {
    dep[u] = dep[fa] + 1;
    if (dep[u] > md) {
      rt = u;
      md = dep[u];
    }
    mson[u] = dep[u];
    for (i32 v : ed[u]) {
      if (v != fa) {
        self(self, v, u);
        if (mson[v] > mson[u]) {
          son[u] = v;
          mson[u] = mson[v];
        }
      }
    }
  };

  dfs(dfs, 1, 1);
  fill(son.begin(), son.end(), 0);
  dep[rt] = 0;
  i32 t = rt;
  dfs(dfs, rt, rt);
  vector<i64> len;
  
//	for (i32 i = 1; i <= n; i++) {
//		cout << son[i] << ' ';
//	}
//	cout << '\n';

  auto tdfs = [&](auto &&self, i32 u, i32 fa, i32 tp) -> void {
  	if (tp == u) {
			len.emplace_back(mson[u] - dep[u] + 1);
		}
    if (son[u]) {
      self(self, son[u], u, tp);
    }
    for (i32 v : ed[u]) {
    	if (v != son[u] && v != fa) {
    		self(self, v, u, v);
			}
		}
  };

//	return 0;
	tdfs(tdfs, t, t, t);
	sort(len.begin(), len.end());
	len.pop_back();
	i64 ans = 0;
	for (auto i : len) {
		ans += min(B, i * A);
	}
	cout << ans << '\n';

  return 0;
}