#include <bits/stdc++.h>
using namespace std;
int n, m, f[305][605], g[305][605];
vector<int> son[305];
void dfs(int p, int q) {
	for (int i = 0; i <= m; i++) {
		f[p][i] = g[p][i] = 1;
	}
	for (int i = 0; i < son[p].size(); i++) {
		if (son[p][i] == q) continue;
		dfs(son[p][i], p);
		for (int j = m; j >= 0; j--) {
			for (int k = 0; k <= j - 2; k++) {
				g[p][j] = max(g[p][j - k - 2] + f[son[p][i]][k], g[p][j]);
			}
		}
		for (int j = m; j >= 0; j--) {
			for (int k = 0; k <= j - 1; k++) {
				g[p][j] = max(f[p][j - k - 1] + g[son[p][i]][k], g[p][j]);
			}
		}
		for (int j = m; j >= 0; j--) {
			for (int k = 0; k <= j - 2; k++) {
				f[p][j] = max(f[p][j - k - 2] + f[son[p][i]][k], f[p][j]);
			}
		}
	}
//	cout << p << "=======" << endl;
//	for (int i = 0; i <= m; i++) {
///		cout << f[p][i] << ' ' << g[p][i] << "|";
//	}
//	cout << endl;
}
int main() {
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);
	cin >> n >> m;
	int q, p;
	for (int i = 1; i < n; i++) {
		cin >> p >> q;
		son[p].push_back(q), son[q].push_back(p);
	}
	dfs(1, 0);
	cout << g[1][m];
	return 0;
}