#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("statiuni.in");
ofstream fout("statiuni.out");

#define nmax 100010
#define mp make_pair
#define f first
#define s second

vector <int> v[nmax];
int viz[nmax];
int length[nmax];
int n,k,ans;

void bf()
{
    queue <pair<int,pair<int,int> > >q;
    int i;
    for(i=1; i<=n; ++i)
    {
        if(v[i].size()==1)
        {
            q.push(mp(i,mp(0,i)));
            viz[i]=1;
        }
    }
    int nod,l,f;
    while(!q.empty())
    {
        nod = q.front().f;
        l = q.front().s.f;
        f = q.front().s.s;
        q.pop();
        if(l==k)
            continue;
        for(auto it:v[nod])
            if(((viz[it]==2 && length[it]>l+1) || viz[it]<2) && it!=f)
            {
                ++viz[it];
                length[it]=l+1;
                q.push(mp(it,mp(l+1,nod)));
            }
    }
}

int main()
{
    fin>>n>>k;
    for(int i=1; i<n; ++i)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    bf();
    for(int i=1; i<=n; ++i)
        if(viz[i]==2)
            ++ans;
    fout<<ans;
}