#include "bits/stdc++.h"
using namespace std;

using ll = long long;
int main(){
    ll N, A, B;
    cin >> N >> A >> B;
    if(N <= 2){
        cout << 0 << "\n";
        return 0;
    }
    vector<vector<int>> G(N);
    for(int i = 0; i < N - 1; i ++){
        int u,v;
        cin >> u >> v;
        u--;v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    ll ans = 0;
    vector<ll> V;
    auto dfs = [&](auto f, int cur, int pre, int len) -> void {
        if(G[cur].size() >= 3){
            // cout << cur << " " << pre << " " << len << endl;
            ans += min(A * len, B);
            V.push_back(min(A * len, B));
            return;
        }
        for(auto e : G[cur]){
            if(pre == e)continue;
            f(f, e, cur, len + 1);
        }
    };
    for(int i = 0; i < N; i++){
        if(G[i].size() == 1)
            dfs(dfs, i, -1, 0);
    }
    sort(V.begin(), V.end(), greater<int>());
    for(int i = 0; i < min(2, (int)V.size()); i++){
        ans -= V[i];
    }
    cout << ans << endl;
}