#include<iostream>
#include<cstring>
#include<queue>

using namespace std;

const int N = 1e5 + 10;
int h[N], e[N], ne[N], idx, n, d;
bool f[N];
queue<int> que;

void connec(int x, int y)
{
    e[idx] = y;
    ne[idx] = h[x];
    h[x] = idx++;

    return;
}
int main()
{
    memset(h, -1, sizeof h);
    cin >> n >> d;
    for (int i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        connec(x, y);
        connec(y, x);
    }
    if (d == 0) { cout << 0 << endl; return 0; }
    int res = 0;
    que.push(1);
    f[1] = 1;
    while (d-- &&que.size()) {
        int size = que.size();
        while (size--) {
            int top = que.front();
            que.pop();
            for (int i = h[top]; i != -1; i = ne[i]) {
                int index_ = e[i];
                if (!f[index_]) que.push(index_), res++, f[index_] = 1;
            }
        }
    }
    cout << res << endl;

    return 0;
}