//******************************** JAI SAI RAM ****************************************//
//help me in codeforces round 635 div2
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
const int sizes=400001,block=700;

ll P=1000000007;
ll MAX=10000*P;
ll MIN=-1*MAX;
    vector<ll> adj[100001];
    ll parent[100001];
    ll vis[100001];
    ll counts[100001];
    vector<ll> levels[sizes];

void count_nodes(ll src,ll e)
    {
        counts[src]=1;
        for(ll i=0;i<adj[src].size();i++)
        {
            ll v=adj[src][i];
            if(v==e)
            {
                continue;
            }
            count_nodes(v,src);
           counts[src]+=counts[v];
        }
    }
   
  void dfs(ll src,ll level)
  {
    vis[src]=1;
    levels[level].push_back(src);
    for(ll i=0;i<adj[src].size();i++)
    {
        if(!vis[adj[src][i]])
        {
            parent[adj[src][i]]=src; 
            dfs(adj[src][i],level+1);
        }
    }
  }
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll t,n,i,j,k,l,m,o,p,q,r,s,a[sizes];
    //cin>>t;
    t=1;
    while(t--)
    {
    string ss;
    vector<ll> v;
    //ll ans=0;
    ll kk;
    cin>>n>>kk;
    memset(counts,0,sizeof(ll)*(n+1));
    memset(vis,0,sizeof(ll)*(n+1));
    memset(parent,0,sizeof(ll)*(n+1));
    for(i=1;i<=n;i++)
    {
        levels[i].clear();
        adj[i].clear();
    }
    for(i=0;i<n-1;i++)
    {
        cin>>j>>k;
        adj[j].push_back(k);
        adj[k].push_back(j);
    }
    
    count_nodes(1,0);
    dfs(1,1);
    ll ans=0;
    l=0;
  k=kk;
    vector<ll> se;
    for(i=n;i>=1;i--)
    {
        for(j=0;j<levels[i].size();j++)
        {
           
             se.push_back((i-1)-(counts[levels[i][j]]-1));
        }
        
    }
   // cout<<se.size()<<endl;
    sort(se.begin(),se.end());
    l=0;
    for(i=se.size()-1;i>=0;i--)
    {
          //cout<<se[i]<<" ";
          if(l>=k)
          break;
          l++;
          ans+=se[i];
    }
    cout<<ans<<endl;
  }
    return 0;
}