#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#define N 1000000
using namespace std;
const int inf=(int)(1e9);
char buf[1<<23],*p1=buf,*p2=buf,obuf[1<<23],*O=obuf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
    while(isdigit(ch)) x=x*10+(ch^48),ch=getchar();
    return x*f;
}
struct reads
{
	int data;
	bool operator < (const reads &t)const
	{
		return data>t.data;
	}
};
struct node
{
	int v,nxt;
};
node edge[N+1];
int n,k,len,head[N+1],lazy1[N+1],lazy2[N+1];
long long ans;
bool used[N+1];
priority_queue<int,vector<int>,greater<int>>q1[N+1];
priority_queue<int,vector<int>,greater<int>>q2[N+1];
void add(int x,int y)
{
	edge[++len]=(node){y,head[x]},head[x]=len;
	edge[++len]=(node){x,head[y]},head[y]=len;
	return;
}
void merge(int x,int y)
{
	while (q1[x].size()+q2[x].size()>q1[y].size()+q2[y].size()) swap(q1[x],q1[y]),swap(q2[x],q2[y]),swap(lazy1[x],lazy1[y]),swap(lazy2[x],lazy2[y]);
	while (!q1[x].empty()) q1[y].push(q1[x].top()+lazy1[x]-lazy1[y]),q1[x].pop();
	while (!q2[x].empty()) q1[y].push(q2[x].top()+lazy2[x]-lazy1[y]),q2[x].pop();
	while (q1[y].size()>((k+1)>>1)) q2[y].push(q1[y].top()+lazy1[y]-lazy2[y]),q1[y].pop();
	while (q1[y].size()+q2[y].size()>k)
	{
		if (!q2[y].empty()) q2[y].pop();
		else q1[y].pop();
	}
	return;
}
void adder(int x)
{
	int top;
	if (!(k&1))
	{
		lazy1[x]++;
		if (!q2[x].empty()) lazy2[x]--;
	}
	else
	{
		lazy1[x]++;
		if (q1[x].size()==((k+1)>>1)) top=q1[x].top(),q1[x].pop(),q1[x].push(top-1);
		if (!q2[x].empty()) lazy2[x]--;
	}
	return;
}
void dfs(int x)
{
	used[x]=1,q1[x].push(0);
	for (int i=head[x];i>0;i=edge[i].nxt)
		if (!used[edge[i].v])
			dfs(edge[i].v),merge(edge[i].v,x);
	adder(x);
	return;
}
int main()
{
	int x,y;
	n=read(),k=read();
	if (n==1&&k==1)
	{
		puts("0");
		return 0;
	}
	for (int i=1;i<=n-1;++i) x=read(),y=read(),add(x,y);
	dfs(1);
	while (!q1[1].empty()) ans+=q1[1].top()+lazy1[1],q1[1].pop();
	while (!q2[1].empty()) ans+=q2[1].top()+lazy2[1],q2[1].pop();
	printf("%lld\n",1ll*(n-1)*k-(ans<<1));
	return 0;
}