#include <bits/stdc++.h>
#include "race.h"
using namespace std;
using ll = long long;
using db = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
const int MOD = 1e9 + 7;
const int MX = 2e5 + 10;
const ll INF = 1e18;
int N, K; ll ans; vpi adj[MX]; unordered_map<int, int> M[MX];
void DFS(int X, int P, int dep) {
M[X][dep] = 1; EACH(Y, adj[X]) if (Y.f != P) {
DFS(Y.f, X, dep + 1); if (sz(M[X]) < sz(M[Y.f])) swap(M[X], M[Y.f]);
EACH(P, M[Y.f]) ans += M[X][K + 2 * dep - P.f];
EACH(P, M[Y.f]) M[X][P.f] += P.s;
}
}
int best_path(int _N, int _K, int H[][2], int L[]) {
N = _N; K = _K; F0R(i, N - 1) {
int A = H[i][0]; int B = H[i][1];
adj[A].pb({B, L[i]}), adj[B].pb({A, L[i]});
}
DFS(0, -1, 0); return ans;
}
