#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#ifdef DEBUG
template<class T>
ostream& operator << (ostream &out,vector<T> a){
	out<<'[';
	for(T x:a)out<<x<<',';
	return out<<']';
}
ostream& operator << (ostream &out,pair<ll,int> a){
	return out<<'('<<a.first<<','<<a.second<<')';
}
template<class T>
vector<T> ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<class T>
void debug(T x){
	cerr<<x<<endl;
}
template<class T,class...S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
#else
#define debug(...) void()
#endif
const int N=5e5+10;
const ll INF=1e12;
int n,k;
vector<int>to[N];
ll ans=INF;
int m,rt,siz[N],mx[N],vis[N];
void dfs1(int u,int fa=0){
	m++;
	for(int v:to[u])if(v^fa&&!vis[v])dfs1(v,u);
}
void dfs2(int u,int fa=0){
	siz[u]=1,mx[u]=0;
	for(int v:to[u])if(v^fa&&!vis[v]){
		dfs2(v,u);
		siz[u]+=siz[v];
		mx[u]=max(mx[u],siz[v]);
	}
	mx[u]=max(mx[u],m-siz[u]);
	if(mx[u]<mx[rt])rt=u;
}
int dep[N],cnt[N],cur[N],top[N];
void dfs3(int u,int t=0,int fa=0){
	dep[u]=fa?dep[fa]+1:0,top[u]=t;
	for(int v:to[u])if(v^fa){
		dfs3(v,t?t:v,u);
	}
}
void solve(int u){
	m=rt=0,dfs1(u),dfs2(u),vis[u=rt]=1,dfs3(u);
	for(int i=1;i<=n;i++)cnt[dep[i]]++;
	for(int i=1;i<=n;i++)cnt[i]+=cnt[i-1];
	for(int i=1;i<=n;i++)cur[cnt[dep[i]]--]=i;
	fill(cnt,cnt+1+n,0);
	int nex=0,now=0;
	ll sum=(n-1ll)*k;
	for(int x=n;x>=1&&now<k;x--){
		int i=cur[x];
		if(i==u){now++;continue;}
		if(++cnt[top[i]]*2>k)nex=top[i];
		else now++,sum-=2*dep[i];
	}
	// debug(u,now,ary(cnt,1,n));
	if(now==k)ans=min(ans,sum);
	fill(cnt,cnt+1+n,0);
	if(nex&&!vis[nex])solve(nex);
}
int main(){
	scanf("%d%d",&n,&k);
	for(int i=1,u,v;i<n;i++){
		scanf("%d%d",&u,&v);
		to[u].push_back(v),to[v].push_back(u);
	}
	mx[0]=n+1;
	solve(1);
	cout<<ans<<endl;
	return 0;
}