评测结果五彩缤纷

#include<bits/stdc++.h>
using namespace std;
struct Node{
    bool c;
    vector<Node*> v;
    int rear;
    bool visited;
    Node(bool b):c(b),rear(0),visited(0){}
};
int dfs(Node* root){
    int sum=0;
    for(int i=0;i<root->rear;i++){
        if(!root->v[i]->visited){
            root->v[i]->visited=1;
            sum+=dfs(root->v[i]);
            if(!root->c&&root->v[i]->c){
                sum++;
                root->c=1;
            }
        }
    }
    return sum;
}
int main(){
    int n;
    cin>>n;
    Node* a[n];
    bool t;
    Node* rt=nullptr;
    for(int i=0;i<n;i++){
        cin>>t;
        a[i]=new Node(t);
        if(t&&!rt)rt=a[i];
    }
    int x,y;
    for(int i=1;i<n;i++){
        cin>>x>>y;
        x--;
        y--;
        a[x]->v.push_back(a[y]);
        a[x]->rear++;
        a[y]->v.push_back(a[x]);
        a[y]->rear++;
    }
    int ans=dfs(rt);
    cout<<ans;
    if(ans%5==0){
        while(true)cout<<"少羽牛逼666";
    }
    return 0;
}