#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ll n, a, b;
    cin >> n >> a >> b;
    vector<vector<ll>> g(n);
    for (int i = 0; i < n - 1; i++) {
        ll u, v;
        cin >> u >> v;
        u--, v--;
        g[u].push_back(v), g[v].push_back(u);
    }
    vector<ll> d1(n, -1), d2(n, -1);
    queue<ll> q;
    q.push(0);
    d1[0] = 0;
    while (!q.empty()) {
        ll u = q.front();
        q.pop();
        for (ll v : g[u]) {
            if (d1[v] == -1) {
                d1[v] = d1[u] + 1;
                q.push(v);
            }
        }
    }
    ll ma_idx = max_element(d1.begin(), d1.end()) - d1.begin();
    q.push(ma_idx);
    d2[ma_idx] = 0;
    while (!q.empty()) {
        ll u = q.front();
        q.pop();
        for (ll v : g[u]) {
            if (d2[v] == -1) {
                d2[v] = d2[u] + 1;
                q.push(v);
            }
        }
    }
    ll res = *max_element(d2.begin(), d2.end());
    cout << (n - 1 - res) * min(a, b) << endl;
}