对自引用父/子列表的子值求和，并将父列表的值设置为

class Node:
    def __init__(self, value, children=None):
        self.value = value
        self.children = children if children is not None else []

# 创建一个简单的自引用列表
root = Node(0)
child1 = Node(1)
child2 = Node(2)
subchild1 = Node(3)
subchild2 = Node(4)

root.children.append(child1)
root.children.append(child2)
child1.children.append(subchild1)
child2.children.append(subchild2)

def update_parent_values(node):
    if not node.children:
        return node.value
    total = node.value
    for child in node.children:
        total += update_parent_values(child)
    node.value = total
    return total

# 更新根节点的值
update_parent_values(root)

# 打印结果
print(f"Updated root value: {root.value}")