#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, d;
vector<int> g[N];
set<int> s;
int vis[N];
void dfs(int u, int fa, int step) {
	vis[u] = 1;
	if (step <= d) {
		s.insert(u);
		if (step == d) return ;
	}
	for (auto v : g[u]) {
		if (!vis[v]) {
			dfs(v, u, step + 1);
		}
	}
}
int main()
{
	cin >> n >> d;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
	}
	dfs(1, 0, 0);
	cout << s.size() - 1;
	return 0;
}