// #pragma GCC optimize("O3,unroll-loops,Ofast")
// #pragma GCC target("avx2")
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define int long long
#define endl '\n'
using namespace std;
using pii = pair<int, int>;
using tup = tuple<int, int, int>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// template <class T> using ordered_set = tree<T, null_type,
// less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int inf = 1e18;
const int mod = 1000000007;
const double eps = 1e-9;
const int N = 500005;
void preprocess() {}
vector<int> e[N];
int sz[N], mx[N];
void dfs(int u, int p) {
sz[u] = 1;
mx[u] = 1;
for(int v : e[u]) if(v != p) {
dfs(v, u);
sz[u] += sz[v];
mx[u] = max(mx[v] + 1, mx[u]);
}
}
int dp[N][105];
int DP(int i, int k, int p) {
if(dp[i][k] != -1) return dp[i][k];
multiset<int> st;
for(int j : e[i]) if(j - p)
st.insert(mx[j]);
int ans = 1;
for(int j : e[i]) if(j - p) {
st.erase(st.find(mx[j]));
ans = max(ans, 1 + DP(j, k, i));
if(st.size()) {
// for(int kk=0; kk<=k; kk++) {
// int now = 1 + DP(j, kk, i);
// now += min(*st.rbegin(), k - kk);
// ans = max(ans, now);
// }
int mxnow = *st.rbegin();
int lo = 0, hi = k;
while(hi - lo >= 5) {
int m1 = lo + (hi - lo) / 3;
int m2 = hi - (hi - lo) / 3;
int f1 = 1 + DP(j, m1, i) + min(mxnow, k - m1);
int f2 = 1 + DP(j, m2, i) + min(mxnow, k - m2);
if(f1 > f2) hi = m2;
else lo = m1;
}
int now = 0;
for(int kk=lo; kk<=hi; kk++)
now = max(now, 1 + DP(j, kk, i) + min(mxnow, k - kk));
ans = max(ans, now);
}
st.insert(mx[j]);
}
return dp[i][k] = ans;
}
void solve(int tc) {
int n, k;
cin >> n >> k;
for(int i=1; i<n; i++) {
int u, v;
cin >> u >> v;
e[u].push_back(v);
e[v].push_back(u);
}
memset(dp, -1, sizeof dp);
dfs(1, -1);
cout << DP(1, k, -1) << endl;
}
int32_t main() {
cin.tie(NULL)->sync_with_stdio(false);
cout.precision(10);
preprocess();
int T = 1;
// cin >> T;
for (int i = 1; i <= T; i++) {
solve(i);
}
return 0;
}