#include <cstdio>

#include <cstring>

#include <cmath>

#include <iostream>

#include <algorithm>

#include <queue>

#include <cstdlib>

#include <stack>

#include <vector>

#include <set>

#include <map>

#define LL long long

#define mod 1000000007

#define inf 0x3f3f3f3f

#define N 250

#define clr(a) (memset(a,0,sizeof(a)))

using namespace std;

struct edge

{

    int next,v;

    edge(){}

    edge(int v,int next):v(v),next(next){}

}e[N*];

int head[N],tot,n,m;

int dp[N][N];

void addedge(int u,int v)

{

    e[tot]=edge(v,head[u]);

    head[u]=tot++;

}

void dfs(int u,int fa)

{

    dp[u][]=;

    for(int i=head[u];~i;i=e[i].next)

    {

        int v=e[i].v;

        if(v==fa)continue;

        dfs(v,u);

        for(int j=m;j>=;j--)

        {

            dp[u][j]++;//对于子树u，要保持j个节点不变，必须砍掉该条边去掉子树v

            for(int k=;k<j;k++)

                dp[u][j]=min(dp[u][j],dp[u][j-k]+dp[v][k]);

        }

    }

}

int main()

{

    int u,v;

    while(scanf("%d%d",&n,&m)>)

    {

        tot=;

        memset(head,-,sizeof(head));

        memset(dp,0x3f,sizeof(dp));

        for(int i=;i<n;i++)

        {

            scanf("%d%d",&u,&v);

            addedge(u,v);

            addedge(v,u);

        }

       dfs(,-);

       int ans=dp[][m];

       for(int i=;i<=n;i++)ans=min(ans,dp[i][m]+);

       printf("%d\n",ans);

    }

}