#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=5e5+5;

char buf[1<<23],*p1=buf,*p2=buf;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
int read(){
    int s=0,w=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')w=-1;ch=getchar();};
    while(isdigit(ch))s=s*10+(ch^48),ch=getchar();
    return s*w;
}

struct Tree{
    int f,ch[2],siz;
    int val,tag;
}t[N];
vector<int>G[N];
int rt[N];
int n,k,siz;
ll ans;

void pushup(int x){
    t[x].siz=t[t[x].ch[0]].siz+t[t[x].ch[1]].siz+1;
}
void upd(int x,int v){
    if(x)t[x].val+=v,t[x].tag+=v;
}
void pushdown(int x){
    if(!t[x].tag)return ;
    upd(t[x].ch[0],t[x].tag);
    upd(t[x].ch[1],t[x].tag);
    t[x].tag=0;
}
void Push(int x){
    if(t[x].f)Push(t[x].f);
    pushdown(x);
}

bool idf(int x){
    return t[t[x].f].ch[1]==x;
}
void rotate(int x){
    int f=t[x].f,ff=t[f].f,op=idf(x);

    t[x].f=ff;
    if(ff)t[ff].ch[idf(f)]=x;

    t[f].ch[op]=t[x].ch[op^1];
    t[t[x].ch[op^1]].f=f;

    t[x].ch[op^1]=f;
    t[f].f=x;

    pushup(f),pushup(x);
}
void splay(int x){
    Push(x);   
    while(t[x].f){
        int f=t[x].f;
        if(t[f].f)
            rotate(idf(x)==idf(f)?f:x);
        rotate(x);
    }
    pushup(x);
}

int newnode(int fath,int val,int id){
    if(!id)id=++siz;
    t[id].ch[0]=t[id].ch[1]=t[id].tag=0;
    t[id].f=fath,t[id].siz=1;
    t[id].val=val;
    return id;
}
int insertt(int &x,int fath,int val,int id){
    // cerr<<x<<" "<<fath<<" "<<val<<" "<<id<<endl;
    if(!x)return x=newnode(fath,val,id);
    pushdown(x);
    int p=insertt(t[x].ch[t[x].val<=val],x,val,id);
    pushup(x);
    return p;
}
void insert(int &x,int y){
    int p=insertt(x,0,t[y].val,y);
    splay(p),x=p;
}
void merge(int &x,int y){
    if(!y)return ;
    pushdown(y);
    merge(x,t[y].ch[0]);
    merge(x,t[y].ch[1]);
    insert(x,y);
}
int kth(int x,int k){
    while(1){
        if(k<=t[t[x].ch[0]].siz)x=t[x].ch[0];
        else if(k==t[t[x].ch[0]].siz+1)return x;
        else k-=t[t[x].ch[0]].siz+1,x=t[x].ch[1];
    }
    return 1;
}

void dfs(int u,int fath){
    for(auto v:G[u])if(v^fath){
        dfs(v,u);
        if(t[rt[v]].siz>t[rt[u]].siz)
            swap(rt[u],rt[v]);
        merge(rt[u],rt[v]);
    }
    // cerr<<"insert u: "<<u<<endl;
    insert(rt[u],0);

    if(u==1)return ;
    if(t[rt[u]].siz<=k/2)
        upd(rt[u],-2);
    else{
        int p=kth(rt[u],k/2+1);
        splay(p),rt[u]=p;
        upd(t[p].ch[0],-2);
        upd(t[p].ch[1],2);
        if(!(k&1))t[p].val+=2;
    }
}

void calc(int x){
    if(!x)return ;
    ans+=t[x].val;
    pushdown(x);
    calc(t[x].ch[0]);
    calc(t[x].ch[1]);
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    cin>>n>>k;
    for(int i=1,u,v;i<n;++i)
        cin>>u>>v,G[u].push_back(v),G[v].push_back(u);

    dfs(1,0);

    int p=kth(rt[1],k);
    splay(p),t[p].ch[1]=0;

    ans=1ll*(n-1)*k;
    calc(p);
    
    cout<<ans<<'\n';
    return 0;
}