人生第一道树题——cf580C 链式前向星，深搜

Description

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. Vertex1 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 mconsecutive 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 andm (2 ≤ n ≤ 10⁵,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 a₁, a₂, ..., a_n, where each a_i either equals to0 (then vertex i has no cat), or equals to1 (then vertex i has a cat).

Next n - 1 lines contains the edges of the tree in the format "x_iy_i" (without the quotes) (1 ≤ x_i, y_i ≤ n,x_i ≠ y_i), wherex_i andy_i 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 mostm consecutive vertices with cats.

Sample Input

Input

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

Output

2

Input

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

Output

2

Sample Output

Hint

Let us remind you that a tree is a connected graph on n vertices andn - 1 edge. A rooted tree is a tree with a special vertex called root. In a rooted tree among any two vertices connected by an edge, one vertex is a parent (the one closer to the root), and the other one is a child. A vertex is called aleaf, if it has no children.

Note to the first sample test: The vertices containing cats are marked red. The restaurants are at vertices 2, 3, 4. Kefa can't go only to the restaurant located at vertex2.

Note to the second sample test: The restaurants are located at vertices 4, 5, 6, 7. Kefa can't go to restaurants 6, 7.

题意很简单，但因为是我第一次做树的题目，加上对卿爷讲的链式前向星不熟悉，卡了很久。

先是如何表示父亲的问题，这需要多开一个数组，并且在搜索中确认没有访问后赋值，否则会父子颠倒。

然后是开数组要开两倍（双向边）

还有就是代码的规范问题，这点要加强训练

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define zuida 100000
using namespace std;
int visit[zuida+10],n,m,fre=0,head[zuida+10],b[zuida+10];//b是每个结点是否有猫
int status[zuida+10]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};//判断是否是叶子结点，是叶子则为1
int cat_lianxu[zuida+10];//到目前为止连续的猫的个数

int father[zuida+10];
struct myk{
int node;
int next;};
myk yuansu[zuida*2+10];

void add_tree(int x,int y)//树的链表存储
{
    yuansu[fre].node=y;
    yuansu[fre].next=head[x];
    head[x]=fre;
    fre++;
}
void dfs(int x)
{
    visit[x]=1;

    for(int i=head[x];i!=-1;i=yuansu[i].next)
    {

        int y=yuansu[i].node;
        if(!visit[y])
        {
            status[x]=0;
            father[y]=x;
            if(b[y]==0)
                cat_lianxu[y]=0;
            else
                cat_lianxu[y]=1+cat_lianxu[x];
            if(cat_lianxu[y]<=m)
                dfs(y);
        }

    }
}

int main(void)
{
    int temp_x,temp_y,num=0;
    memset(head,-1,sizeof(head));
    memset(visit,0,sizeof(0));



    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&b[i]);
    for(int i=1;i<=n;i++)
        status[i]=1;
    for(int i=1;i<n;i++)
    {
        scanf("%d%d",&temp_x,&temp_y);
        add_tree(temp_x,temp_y);
        add_tree(temp_y,temp_x);
    }

    cat_lianxu[1]=b[1];
    dfs(1);

    for(int i=1;i<=n;i++)
    {
        if((status[i])&&(visit[i]))
            num++;
    }
    printf("%d",num);
    return 0;

}