#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 2e5 + 5;
int n;
long long x, y;
vector<int> adjlist[mx];
int tot;
bool available[mx];
void dfs(int u, int par) {
  int ret = 0;
  for (auto v : adjlist[u]) {
    if (v == par) continue;
    dfs(v, u);
    if (available[v]) ++ret;
  }
  if (ret == 0)
    available[u] = 1;
  else if (ret == 1) {
    ++tot;
    available[u] = 1;
  } else {
    tot += 2;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> x >> y;
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    adjlist[u].push_back(v);
    adjlist[v].push_back(u);
  }
  if (x > y) {
    bool ok = 0;
    for (int i = 1; i <= n; ++i) {
      if ((int)adjlist[i].size() == n - 1) ok = 1;
    }
    if (ok) {
      long long ans = (y * (n - 2)) + x;
      cout << ans << '\n';
      return 0;
    }
    long long ans = y * (n - 1);
    cout << ans << '\n';
    return 0;
  }
  dfs(1, 0);
  long long ans = tot * x + (n - 1 - tot) * y;
  cout << ans << '\n';
}
