The main problem is that you are taking those nodes into queue which are already having more than m consecutive cats in their path, the paths formed by them should never contribute to the answer.

Just put condition to check if number of consecutive cats till child node is less than or equal to m or not, then add that node to the queue.

Corrected Code

    #include <bits/stdc++.h>
    using namespace std;
    int main(){
        int vis[100005]{};
        int n,m;
        cin>>n>>m;
        vector<int> id(n+1);
        vector<vector<int>> graph(n+1);
        for (int i =1 ;i<=n;i++){
            cin>>id[i];
        }
        int tmp = 1;
        for (int i = 0; i<n-1; i++){
            int x,y;
            cin>>x>>y;
            graph[x].push_back(y);
            graph[y].push_back(x);
        }
        int cnt = 0;
        queue<int> q;
        vector<int> no(n+1,0);
        q.push(1);
        vis[1]=1;
        if (id[1]==1){
            no[1]++;
        }
        while (q.size()){
            int ori = q.front();
            q.pop();
            if (id[ori]==0 && (graph[ori].size()!=1 || ori==1)){
                no[ori]=0;
            }
            for (int child:graph[ori]){
                if (!vis[child]){
                    vis[child] = 1;
                    no[child]=no[ori]+id[child];
                    if (graph[child].size()==1 && no[child]<=m){
                    ++cnt;
                    continue;
                    }
                    if(no[child]<=m)
                      q.push(child);
                }
     
            }
        }
        cout<<cnt<<endl;
    }