#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define rep(x,l,r) for(int x=l;x<=r;x++)
#define per(x,r,l) for(int x=r;x>=l;x--)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()

const int MOD=998244353;
int power(int a,int k,int mod=MOD) {
    k%=mod-1; if(k<0) k+=mod-1;
    int res=1; while(k) {
        if(k&1) res=1ll*res*a%mod;
        a=1ll*a*a%mod,k>>=1;
    } return res;
}

const int N=500500;

int n,a,b;
vector<int> G[N];

int dep[N];
void dfs(int u,int father) {
    dep[u]=dep[father]+1;
    for(int v:G[u]) {
        if(v==father) continue;
        dfs(v,u);
    }
}

int md[N];
vector<int> rec[N];
void dfs2(int u,int father) {
    md[u]=0;
    for(int v:G[u]) {
        if(v==father) continue;
        dfs2(v,u);
        rec[u].pb(md[v]+1);
        md[u]=max(md[u],md[v]+1);
    }
    sort(all(rec[u]));
    if(rec[u].size()) rec[u].pop_back();
}

int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>a>>b;
    rep(i,1,n-1) {
        int u,v; cin>>u>>v;
        G[u].pb(v),G[v].pb(u);
    }
    dfs(1,0);
    int k=0; rep(i,1,n) if(dep[i]>dep[k]) k=i;
    dfs2(k,0);
    // int mx=0; rep(i,1,n) mx=max(mx,dep[i]);
    // rep(i,1,n) cout<<dep[i]<<' '; cout<<'\n';
    // k=n-mx;
    // cout<<1ll*k*min(a,b);
    ll ans=0;
    rep(i,1,n) {
        for(int j:rec[i]) {
            ans+=min((ll)b,1ll*a*j);
        }
    }
    cout<<ans;
    return 0;
}