#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define rep(i, l, r) for(ll i = l; i < r; i++)
#define all(ar) begin(ar), end(ar)

void chmin(ll &a, ll b) { a = min(a, b); }

void solve() {
    ll n, a, b;
    cin >> n >> a >> b;
    chmin(a, b);
    vector<vector<int>> g(n);
    rep(i, 0, n - 1) {
        ll u, v;
        cin >> u >> v;
        u--;
        v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    auto dfs = [&](auto self, ll v, ll p) -> pair<ll, ll> {
        vector<pair<ll, ll>> ch;
        for(int u : g[v]) {
            if(u != p) {
                ch.push_back(self(self, u, v));
            }
        }

        if(ch.empty()) return {0, 0};
        for(auto &[f, s] : ch) {
            s += a;
        }

        sort(all(ch), [&](pair<ll, ll> p1, pair<ll, ll> p2) {
            return p1.second - p1.first < p2.second - p2.first;
        });

        vector<ll> res(2, 1LL << 60);

        ll s1 = 0;
        for(auto [f, s] : ch) s1 += f;
        res[(ch.size() + 1) % 2] = s1 + (ch.size() / 2) * b;
        rep(i, 0, ch.size()) {
            s1 -= ch[i].first;
            s1 += ch[i].second;
            chmin(res[(ch.size() - i) % 2], s1 + ((ch.size() - i - 1) / 2) * b);
        }
        // cout << v + 1 << " " << res[0] << " " << res[1] << endl;
        return {res[0], res[1]};
    };

    int r = 0;
    while(g[r].size() > 1) r++;

    auto [f, s] = dfs(dfs, r, -1);
    cout << f << endl;
}

int main() {
    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
}