Kefa and Park

Kefa decided to celebrate his first big salary by going to the restaurant.

He lives by an unusual park. The park is a rooted tree consisting of n vertices with the root at vertex 1. Vertex 1 also contains Kefa's house. Unfortunaely for our hero, the park also contains cats. Kefa has already found out what are the vertices with cats in them.

The leaf vertices of the park contain restaurants. Kefa wants to choose a restaurant where he will go, but unfortunately he is very afraid of cats, so there is no way he will go to the restaurant if the path from the restaurant to his house contains more than m consecutive vertices with cats.

Your task is to help Kefa count the number of restaurants where he can go.

Input

The first line contains two integers, n and m (2 ≤ n ≤ 105, 1 ≤ m ≤ n) — the number of vertices of the tree and the maximum number of consecutive vertices with cats that is still ok for Kefa.

The second line contains n integers a1, a2, ..., an, where each ai either equals to 0 (then vertex i has no cat), or equals to 1 (then vertex i has a cat).

Next n - 1 lines contains the edges of the tree in the format "xi yi" (without the quotes) (1 ≤ xi, yi ≤ n, xi ≠ yi), where xi and yi are the vertices of the tree, connected by an edge.

It is guaranteed that the given set of edges specifies a tree.

Output

A single integer — the number of distinct leaves of a tree the path to which from Kefa's home contains at most m consecutive vertices with cats.

Input：

4 1
1 1 0 0
1 2
1 3
1 4

Out:

7 1
1 0 1 1 0 0 0
1 2
1 3
2 4
2 5
3 6
3 7

        题解就是树的遍历，只不过要注意一下，判断是否是叶子结点的方式：

        若深度为1，且u = h[u],即叶子结点。

        完整代码：

#include<bits/stdc++.h>
#define int long long 
#define rep(i, a, b) for(int i = a; i <= b; ++ i)
#define per(i, a, b) for(int i = a; i >= b; -- i)
using namespace std;
const int N = 2e5 +10,mod = 1e9 + 7;
int e[N],h[N],ne[N],idx;

int n,k;
int cat[N],st[N];

void add(int a,int b){
	e[idx] = b;ne[idx] = h[a];h[a] = idx++;
}

int ans;

void dfs(int u,int f,int cnt,int pre){
	st[u] = true;
	int depth = 0;
	int c = cnt,j;
	for(int i = h[u];i != -1;i = ne[i]){
		j = e[i];
		depth++;
		cnt = c;
		if(!st[j]){
			if(!f)cnt = 0;
			cnt += cat[j];
			if(cnt > k) continue ;
			dfs(j,cat[j],cnt,u);
		}
	}
	if(depth == 1 && pre == j){
		if(cnt <= k) ans++;
	}
}
signed main(){
	cin >> n >> k;
	memset(h,-1,sizeof h);
	
	rep(i,1,n) cin >> cat[i];
	rep(i,1,n-1){
		int a,b; cin >> a >> b;
		add(a,b); add(b,a);
	}
	
	dfs(1,cat[1],cat[1],0);
	
	cout << ans << endl;
	
    return 0;
}