#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a > b)
    return b;
  else
    return a;
}
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long normalize(long long x, long long mod) {
  x %= mod;
  if (x < 0) x += mod;
  return x;
}
long long dx[4] = {0, 0, 1, -1};
long long dy[4] = {1, -1, 0, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
const double PI = acosl(-1);
const long long mod = 1000 * 1000 * 1000 + 7;
const long long inf = 1e18 + 5;
inline long long add(long long a, long long b, long long p = mod) {
  long long c = a + b;
  if (c >= p) c -= p;
  return c;
}
inline long long sub(long long a, long long b, long long p = mod) {
  long long c = a - b;
  if (c < 0) c += p;
  return c;
}
inline long long mul(long long a, long long b, long long p = mod) {
  return (a * 1LL * b) % p;
}
long long floor1(long long n, long long k) {
  if (n % k == 0 || n >= 0) return n / k;
  return (n / k) - 1;
}
long long ceil1(long long n, long long k) { return floor1(n + k - 1, k); }
long long powm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
const long long N = 2e5 + 5;
long long n, x, y;
vector<long long> g[N];
long long deg[N];
long long d;
long long dfs(long long v, long long p) {
  long long i, u, n = 0;
  for (long long u : g[v]) {
    if (u == p) continue;
    n += dfs(u, v);
  }
  if (n >= 2) {
    d += (n - 2);
    if (p >= 0) ++d;
    return 0;
  }
  return 1;
}
void solve() {
  cin >> n >> x >> y;
  long long mx = 0;
  for (long long i = (1); i < (n); ++i) {
    long long u, v;
    cin >> u >> v;
    ++deg[u];
    ++deg[v];
    g[u].push_back(v);
    g[v].push_back(u);
    mx = max(mx, max(deg[u], deg[v]));
  }
  if (x > y) {
    if (mx == n - 1) {
      cout << (y * (n - 2) + x);
    } else {
      cout << (y * (n - 1));
    }
    return;
  }
  dfs(1, -1);
  cout << (d * y + (n - 1 - d) * x);
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  long long t = 1;
  for (long long i = (1); i < (t + 1); ++i) {
    solve();
  }
  return 0;
}
