#include <bits/stdc++.h>
long long aq,ans;
int N,A,B,hd[500009],to[1000009],nxt[1000009],k,f[500009];
void l(int u,int v) {
    to[++k]=v;nxt[k]=hd[u];hd[u]=k;
}
void dfs(int n,int ff) {
    int ma=0;
    std::vector<int> tp;
    for(int i=hd[n];i;i=nxt[i]) {
        if(to[i]==ff) continue;
        dfs(to[i],n);
        tp.push_back(f[to[i]]);
    }
    std::sort(tp.begin(),tp.end());
    for(int i=0;i+1<tp.size();i+=2) {
        aq+=std::min(1ll*A*(tp[i]+tp[i+1]),(long long)B);
    }
    if(tp.size()%2==1) ma=tp[tp.size()]-1;
    f[n]=ma+1;
}
signed main(void) {
    scanf("%d %d %d",&N,&A,&B);
    for(int i=1;i<N;i++) {
        int x,y;
        scanf("%d %d",&x,&y);
        l(x,y);
        l(y,x);
    }
    ans=0x3f3f3f3f3f3f;
    for(int i=1;i<=N;i++) {
        aq=0;
        dfs(i,0);
        ans=std::min(ans,aq);
    }
    printf("%lld",ans);
}