#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template <typename T> using vc = vector<T>;
template <typename T> using vvc = vector<vector<T>>;
template <typename T> using vvvc = vector<vector<vector<T>>>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }
template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }

int dx4[] = {1,0,-1,0};
int dy4[] = {0,1,0,-1};

#define overload5(a, b, c, d, e, name, ...) name
#define overload4(a, b, c, d, name, ...) name
#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)
#define REP1(i, n) for(ll i = 0; i < (n); ++i)
#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)
#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)
#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)
#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))
#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define drop(s) cout << #s << endl, exit(0)
#define si(c) (int)(c).size()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))
#define rng(v, l, r) v.begin() + (l), v.begin() + (r)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define SORT(v) sort(all(v))
#define REV(v) reverse(all(v))
#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))

ll inf = 1001001001001001001;

ll dp[500500][2];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,A,B;
    cin >> N >> A >> B;
    chmin(A,B);
    vvc<int>ki(N);
    rep(i,N-1) {
        int u,v;
        cin >> u >> v;
        u--;
        v--;
        ki[u].pb(v);
        ki[v].pb(u);
    }
    auto dfs = [&](auto &dfs,int n,int p) -> void {
        ll ans = 0;
        ll res = 0;
        for(auto i:ki[n]) {
            if(i == p) continue;
            dfs(dfs,i,n);
            ans += min(dp[i][0]+A,dp[i][1]+B);
            chmax(res,min(dp[i][0]+A,dp[i][1]+B)-dp[i][1]);
        }
        dp[n][0] = ans;
        dp[n][1] = ans-res;
    };
    dfs(dfs,0,-1);
    ll ans = inf;
    auto dfs2 = [&](auto &dfs2,int n,int p,pll a) -> void {
        vc<pll>res;
        for(auto i:ki[n]) {
            if(i == p) continue;
            res.pb({min(dp[i][0]+A,dp[i][1]+B),dp[i][1]});
        }
        if(n != 0) res.pb(a);
        multiset<ll>st;
        ll sum = 0;
        rep(i,si(res)) {
            sum += res[i].fi;
            st.insert(res[i].fi-res[i].se);
        }
        st.insert(0);
        chmin(ans,sum-*st.rbegin());
        for(auto i:ki[n]) {
            if(i == p) continue;
            sum -= min(dp[i][0]+A,dp[i][1]+B);
            ll now = min(dp[i][0]+A,dp[i][1]+B)-dp[i][1];
            st.erase(st.find(now));
            dfs2(dfs2,i,n,{min(sum+A,sum-*st.rbegin()+B),sum-*st.rbegin()});
            st.insert(now);
            sum += min(dp[i][0]+A,dp[i][1]+B);
        }
    };
    dfs2(dfs2,0,-1,{0,0});
    cout << ans << "\n";
}