#include <bits/stdc++.h>
using namespace std;
const int N=150+5;
const int inf=0x3f3f3f3f;
struct sdf{
    int to,next;
}eg[2*N];
int head[N]={0},ne=0;
int n,p;
void add(int x,int y){
    eg[++ne]={y,head[x]};
    head[x]=ne;
    return ;
}
int sz[N],f[N][N],ans=inf;
void pre(int pt,int fa){
    sz[pt]=1;
    for (int i=head[pt];i!=0;i=eg[i].next){
        int v=eg[i].to;
        if (v==fa)continue;
        pre(v,pt);sz[pt]+=sz[v];
    }
    return ;
}
void dfs(int pt,int fa){
    f[pt][0]=0;
    for (int i=head[pt];i!=0;i=eg[i].next){
        int v=eg[i].to;
        if (v==fa)continue;
        dfs(v,pt);
        f[v][sz[v]]=1;
        for (int j=sz[pt];j>=0;j--){
            for (int k=0;k<=min(j,sz[v]);k++){
                f[pt][j]=min(f[pt][j],f[pt][j-k]+f[v][k]);
            }
        }
        ans=min(ans,f[v][sz[v]-p]+1);
    } 
    ans=min(ans,f[pt][n-p]);
    return ;
}
int main(){
    freopen ("reroads.in","r",stdin);
	freopen ("reroads.out","w",stdout);
	scanf("%d%d",&n,&p);
	for (int i=1;i<n;i++){
	    int x,y;scanf("%d%d",&x,&y);
	    add(x,y);add(y,x);
    }
    memset(f,0x3f,sizeof(f));
    pre(1,1);
    dfs(1,1);
    printf("%d\n",ans);
    return 0;
}