https://ac.nowcoder.com/acm/contest/322/C

题解：DFS

历遍图就行了

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=200000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans,u,v;
int a[N];
ll b[N];
char str;
vector<int>G[N];
bool vis[N];
void dfs(int x){

    if(G[x].empty()){
        return;
    }
    if(a[x]<k){
        b[x]++;
        //cout<<b[x]<<endl;
    }
    for(int i=0,j=G[x].size();i<j;i++){
        if(!vis[G[x][i]]){
            vis[G[x][i]]=1;
            dfs(G[x][i]);
            b[x]+=b[G[x][i]];
        }
    }
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }

    for(int i=1;i<n;i++){
        scanf("%d%d",&u,&v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    memset(b,0,sizeof(b));
    vis[1]=1;
    dfs(1);
    for(int i=1;i<=n;i++){
        if(i==n)
        printf("%lld\n",b[i]);
        else
        printf("%lld ",b[i]);
    }
    //cout << "Hello world!" << endl;
    return 0;
}