#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(s...) orange_(#s, s)
#define debug(s...) debug_(#s, s)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void debug_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define orange(...) safe
#define debug(...) safe
#endif

constexpr int maxn = 100000 + 5;

int k;
vector<int> g[maxn];

tuple<int, int, bool> dfs(int u, int f) {
    tuple<int, int, bool> r = {0, 0, true};
    vector<int> more, less;
    for (int v : g[u]) {
        if (v == f) continue;
        auto [tot, w, need] = dfs(v, u);
        get<0>(r) += tot;
        if (need) less.push_back(w + 1);
        else more.push_back(w - 1);
    }
    if (not less.empty() and not more.empty()) {
        int l = *max_element(less.begin(), less.end());
        int m = *max_element(more.begin(), more.end());
        if (m >= l) {
            get<1>(r) = m;
            get<2>(r) = false;
        } else if (l == k) {
            get<0>(r) += 1;
            get<1>(r) = k;
            get<2>(r) = false;
        } else {
            get<1>(r) = l;
        }
    } else if (not more.empty()) {
        int mx = *max_element(more.begin(), more.end());
        if (mx >= 0) {
            get<1>(r) = mx;
            get<2>(r) = false;
        }
    } else if (not less.empty()) {
        int mi = *max_element(less.begin(), less.end());
        if (mi == k) {
            get<0>(r) += 1;
            get<1>(r) = k;
            get<2>(r) = false;
        } else {
            get<1>(r) = mi;
        }
    }
    return r;
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n; cin >> n >> k;
    for (int i = 1; i < n; ++i) {
        int u, v; cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    auto [tot, w, need] = dfs(1, 1);
    if (need) tot++;
    cout << tot << '\n';
    return 0;
}