def subtree_nodes_with_same_label(number_of_nodes, edges, labels):
    adjacency_list = [[] for _ in range(number_of_nodes)]
    for edge_start, edge_end in edges:
        adjacency_list[edge_start].append(edge_end)
        adjacency_list[edge_end].append(edge_start)

    result = [0] * number_of_nodes

    for current_node in range(number_of_nodes):
        # We begin by considering each node as the root.
        count = 0
        visited = [False] * number_of_nodes

        def depth_first_search(node):
            nonlocal count
            visited[node] = True
            if labels[node] == labels[current_node]:
                count += 1

            # Iterating thru all the descendants of the current node.
            for neighbor in adjacency_list[node]:
                if not visited[neighbor]:
                    depth_first_search(neighbor)

        depth_first_search(current_node)
        result[current_node] = count

    # Returns the list with the final count.
    return result

def subtree_nodes_with_same_label(number_of_nodes, edge_list, labels):    graph = [[] for _ in range(number_of_nodes)]    for start_node, end_node in edge_list:      graph[start_node].append(end_node)
      graph[end_node].append(start_node)
    node_count_with_same_labels = [0] * number_of_nodes
    visited = [False] * number_of_nodes
    def depth_first_search(current_node):
      visited[current_node] = True
      # Initialize count for the current node's label
      node_counts = {}
      node_counts[labels[current_node]] = 1
      # Iterate through each neighbor of the current node
      for neighbor in graph[current_node]:
        if not visited[neighbor]:

          neighbor_node_counts = depth_first_search(neighbor)
          # Aggregate child counts into the current node counts.
          for label, count in neighbor_node_counts.items():
            node_counts[label] = node_counts.get(label, 0) + count
      
      node_count_with_same_labels[current_node] = node_counts.get(labels[current_node], 0)
      return node_counts

    # Start the depth-first search from node 0.
    depth_first_search(0)
    return node_count_with_same_labels