#include <bits/stdc++.h>

using namespace std;

using uint = unsigned;
using ll = long long;

const int N = 5e5;

int n, m;
vector<int> e[N + 5];

mt19937 rng(20070924);

struct FHQTreap {
  struct node {
    int val, tag;
    int siz;
    uint rnd;
    int ls, rs;
  } tr[N + 5];
  int tot;
  int newNode(int k) { int u = ++tot; tr[u].val = k, tr[u].siz = 1, tr[u].rnd = rng(); return u; }
  void pushUp(int u) { tr[u].siz = tr[tr[u].ls].siz + 1 + tr[tr[u].rs].siz; }
  void apply(int k, int u) { if (!u) return ; tr[u].val += k, tr[u].tag += k; }
  void pushDown(int u) {
    if (!tr[u].tag) return ;
    apply(tr[u].tag, tr[u].ls), apply(tr[u].tag, tr[u].rs), tr[u].tag = 0;
  }
  int join(int u, int v) {
    if (!u || !v) return u | v;
    pushDown(u), pushDown(v);
    if (tr[u].rnd < tr[v].rnd) { tr[u].rs = join(tr[u].rs, v), pushUp(u); return u; }
    else { tr[v].ls = join(u, tr[v].ls), pushUp(v); return v; }
  }
  pair<int, int> split(int k, int u) {
    if (!u) return {0, 0};
    pushDown(u);
    pair<int, int> ret;
    if (tr[u].val <= k) tr[u].rs = (ret = split(k, tr[u].rs)).first, ret.first = u;
    else tr[u].ls = (ret = split(k, tr[u].ls)).second, ret.second = u;
    pushUp(u);
    return ret;
  }
  pair<int, int> splitRank(int k, int u) {
    if (!u) return {0, 0};
    pushDown(u);
    pair<int, int> ret;
    if (tr[tr[u].ls].siz < k) tr[u].rs = (ret = splitRank(k - tr[tr[u].ls].siz - 1, tr[u].rs)).first, ret.first = u;
    else tr[u].ls = (ret = splitRank(k, tr[u].ls)).second, ret.second = u;
    pushUp(u);
    return ret;
  }
  int merge(int u, int v) {
    if (!u || !v) return u | v;
    pushDown(u), pushDown(v);
    if (tr[u].rnd > tr[v].rnd) swap(u, v);
    auto [ls, rs] = split(tr[u].val, v);
    tr[u].ls = merge(tr[u].ls, ls), tr[u].rs = merge(tr[u].rs, rs);
    pushUp(u);
    return u;
  }
  ll sum(int u) {
    if (!u) return 0;
    pushDown(u);
    return tr[u].val + sum(tr[u].ls) + sum(tr[u].rs);
  }
} treap;

int fa[N + 5], rt[N + 5];
void dfs(int u) {
  rt[u] = treap.newNode(0);
  for (int v: e[u])
    if (v != fa[u]) {
      fa[v] = u, dfs(v);
      int rt0, rt1, rt2;
      tie(rt0, rt1) = treap.splitRank(m >> 1, rt[v]), tie(rt1, rt2) = treap.splitRank(m & 1, rt1),
      treap.apply(-2, rt0), treap.apply(2, rt2),
      rt[u] = treap.merge(rt[u], treap.join(rt0, treap.join(rt1, rt2)));
    }
}

ll ans;

int main() {
  scanf("%d%d", &n, &m);
  for (int i = 2; i <= n; ++i) { int u, v; scanf("%d%d", &u, &v), e[u].push_back(v), e[v].push_back(u); }
  if (m == 1) { printf("%d\n", n - 1); return 0; }
  dfs(1), ans = (ll)m * (n - 1) + treap.sum(treap.splitRank(m, rt[1]).first);
  printf("%lld\n", ans);
}