#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int n, p, rt, f[155][155], siz[155];
int e, to[155], h[155], nx[155];
bool vis[155];

void dfs(int u){
siz[u] = 1;
int k = 1;
for(int i = h[u]; i; i = nx[i]){
k++;
dfs(to[i]);
siz[u] += siz[to[i]];
}
f[u][siz[u]] = 0;
f[u][1] = k;
}

void dp(int u){
if(siz[u] == 1) return;
for(int i = h[u]; i; i = nx[i]){
int v = to[i];
dp(v);
for(int j = siz[u]; j > 0; j--){
f[u][j] = min(f[u][j], f[u][j+siz[v]]+1);
for(int k = siz[v]; k > 0; k--){
f[u][j] = min(f[u][j], f[u][j+siz[v]-k]+f[v][k]);
}
}
}
}

int main()
{


while(scanf("%d %d", &n, &p)){
memset(f, 0x3f, sizeof f);
memset(h, 0, sizeof h);
memset(to, 0, sizeof to);
memset(siz, 0, sizeof siz);
memset(nx, 0, sizeof nx);
memset(vis, 0, sizeof vis);
for(int i = 1; i < n; i++){
int u, v;
scanf("%d %d", &u, &v);
to[++e] = v;
nx[e] = h[u];
h[u] = e;
vis[v] = 1;
}
for(int i = 1; i <= n; i++)
if(!vis[i]){rt = i; break;}

dfs(rt);
dp(rt);

int ans = 1<<30;
for(int i = 1; i <= n; i++)
if(siz[i] >= p) ans = min(ans, f[i][p]+(i!=rt));

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

return 0;
}