#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <climits>
#include <iomanip>
using namespace std;

void solve([[maybe_unused]] int t)
{
  long long n, A, B;
  cin >> n >> A >> B;

  vector grafo(n, vector<int>());
  for (int i = 0; i < n - 1; i++)
  {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    grafo[u].push_back(v);
    grafo[v].push_back(u);
  }

  const long long INF = 1e15;
  vector dp(n, vector(3, -1ll));
  auto f = [&](auto &f, int v, int mode, int last) -> long long
  {
    if (dp[v][mode] != -1)
      return dp[v][mode];

    long long res = 0;
    if (mode == 1)
    {
      vector<long long> tmp;
      for (auto i : grafo[v])
      {
        if (i != last)
        {
          res += A + f(f, i, 0, v);
          tmp.push_back(f(f, i, 1, v) - A - f(f, i, 0, v));
        }
      }

      sort(tmp.begin(), tmp.end());
      if (tmp.size() > 0)
      {
        res += tmp[0];
        tmp.erase(tmp.begin());
      }

      for (int i = 0; i < tmp.size(); i += 2)
      {
        if (tmp[i] + (i + 1 < tmp.size() ? tmp[i + 1] : 0) + B < 0)
        {
          res += tmp[i] + (i + 1 < tmp.size() ? tmp[i + 1] : 0) + B;
        }
        else
        {
          break;
        }
      }
    }
    else if (mode == 0)
    {
      vector<long long> tmp;
      for (auto i : grafo[v])
      {
        if (i != last)
        {
          res += A + f(f, i, 0, v);
          tmp.push_back(f(f, i, 1, v) - A - f(f, i, 0, v));
        }
      }

      sort(tmp.begin(), tmp.end());

      if (tmp.size() == 0)
        return 0;

      for (int i = 0; i < tmp.size(); i += 2)
      {
        if (tmp[i] + (i + 1 < tmp.size() ? tmp[i + 1] : 0) + B < 0)
        {
          res += tmp[i] + (i + 1 < tmp.size() ? tmp[i + 1] : 0) + B;
        }
        else
        {
          break;
        }
      }
    }
    else
    {
      vector<long long> tmp;
      for (auto i : grafo[v])
      {
        if (i != last)
        {
          res += A + f(f, i, 0, v);
          tmp.push_back(f(f, i, 1, v) - A - f(f, i, 0, v));
        }
      }

      sort(tmp.begin(), tmp.end());

      if (tmp.size() == 0)
        res = 0;
      else
      {
        if (tmp.size() > 0)
        {
          res += tmp[0];
          tmp.erase(tmp.begin());
        }
        if (tmp.size() > 0)
        {
          res += tmp[0];
          tmp.erase(tmp.begin());
        }
        for (int i = 0; i < tmp.size(); i += 2)
        {
          if (tmp[i] + (i + 1 < tmp.size() ? tmp[i + 1] : 0) + B < 0)
          {
            res += tmp[i] + (i + 1 < tmp.size() ? tmp[i + 1] : 0) + B;
          }
          else
          {
            break;
          }
        }
      }

      tmp.clear();
      long long res2 = 0, mini = INF;

      for (auto i : grafo[v])
      {
        if (i != last)
        {
          res2 += A + f(f, i, 0, v);
          mini = min(mini, f(f, i, 2, v) - A - f(f, i, 0, v));
        }
      }

      res = min(res, res2 + mini);
    }

    // cout << v << " " << mode << " " << res << "\n";
    return dp[v][mode] = res;
  };

  cout << f(f, 0, 2, -1) << "\n";
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);

  int n = 1;
  // cin >> n;
  for (int i = 1; i <= n; i++)
    solve(i);
}