// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.end());}
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

template <typename T>
struct edge{
  int from, to;
  T w;
  edge(){}
  edge(int from, int to, T w): from(from), to(to), w(w){}
};

int start, en;

template <typename T>
struct Tree{
  int n = 0;
  vector<vector<edge<T>>> edges;
  vector<T> dis;
  Tree(){}
  explicit Tree(int n): n(n){
    edges.resize(n);
    dis.resize(n);
  }
  void adde(int from, int to, T cost){
    edges[from].emplace_back(from, to, cost);
  }
  void dfs(int i){
    for(auto e: edges[i]){
      if(dis[e.to] == -1){
        dis[e.to] = dis[i] + e.w;
        dfs(e.to);
      }
    }
  }
  T diameter(){
    dis.assign(n, -1);
    dis[0] = 0;
    dfs(0);
    int at = 0;
    T maxi = -1;
    for(int i = 0; i < n; i++){
      if(maxi < dis[i]){
        maxi = dis[i];
        at = i;
      }
    }
    dis.assign(n, -1);
    dis[at] = 0;
    start = at;
    dfs(at);
    T res = -1;
    for(int i = 0; i < n; i++){
      bool b = chmax(res, dis[i]);
      if(b)en = i;
    }
    return res;
  }
};


vector<int> edges[2010];
int siz[2010], h[2010], hm[2010];
ll dp[2010][2010];
ll tmp[2010], tmp2[2010];
int k, n;
vector<int> v;
bool dfs2(int i, int p, int tar){
  v.pb(i);
  if(i == tar)return true;
  for(auto e: edges[i]){
    if(e == p)continue;
    bool b = dfs2(e, i, tar);
    if(b)return true;
  }
  v.pop_back();
  return false;
}

void dfs(int i, int p){
  siz[i] = 1;
  hm[i] = h[i];
  if(p != -1 && sz(edges[i]) == 1){
    dp[i][0] = 1;
    dp[i][1] = 0;
    return;
  }
  int fi = -2;
  for(auto e: edges[i]){
    if(e == p)continue;
    if(fi == -2)fi = e;
    h[e] = h[i] + 1;
    dfs(e, i);
    chmax(hm[i], hm[e]);
    siz[i] += siz[e];
  }
  fill(tmp, tmp + n + 1, inf);
  rep(j, hm[fi] - h[fi] + 2)tmp[j] = dp[fi][j];
  int b = min(k, hm[fi] - h[fi] + 1);
  for(auto e: edges[i]){
    if(e == p || e == fi)continue;
    int bt = b;
    rep(j, min(k, b + hm[e] - h[e] + 1) + 1)tmp2[j] = inf;
    for(int l = 0; l <= max(k, hm[e] - h[e] + 1); l++){
      for(int m = 0; m <= b; m++){
        if(l + m > k)break;
        chmax(bt, max(l, m));
        chmin(tmp2[max(l, m)], tmp[m] + dp[e][l]);
      }
    }
    swap(tmp, tmp2);
    b = bt;
  }
  rep(j, b + 1){
    dp[i][j+1] = tmp[j];
  }
  dp[i][0] = siz[i];
  //rep(j, b + 2)cerr << i << " " << j << " " << dp[i][j] << endl;
}

int main(int argc, char const* argv[])
{
  cin >> n >> k;
  Tree<int> t(n);
  rep(i, n - 1){
    int a, b; cin >> a >> b, a--, b--;
    edges[a].pb(b);
    edges[b].pb(a);
    t.adde(a, b, 1);
    t.adde(b, a, 1);
  }
  t.diameter();
  dfs2(start, -1, en);

  rep(i, n)rep(j, n + 1)dp[i][j] = inf;
  dfs(v[sz(v)/2], -1);
  ll res = inf;
  rep(i, k + 2)chmin(res, dp[v[sz(v)/2]][i]);

  if(sz(v) % 2 == 0){
    rep(i, n)rep(j, n + 1)dp[i][j] = inf;
    h[v[sz(v)/2-1]] = 0;
    dfs(v[sz(v)/2-1], -1);
    rep(i, k + 2)chmin(res, dp[v[sz(v)/2-1]][i]);
  }

  random_device rnd;
  mt19937 mt(rnd());
  uniform_int_distribution<> randi(0, n - 1);
  rep(l_, 100){
    int l = randi(mt);
    rep(i, n)rep(j, n + 1)dp[i][j] = inf;
    h[l] = 0;
    dfs(l, -1);
    rep(i, k + 2)chmin(res, dp[l][i]);
  }
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 32128