The minimal spanning tree’s linear programming model is to minimize the sum of weights for branches in the tree, and the constraints utilize the 0-1 model and require ( ).
选项：

A:At least one edge connecting the root with other nodes
B:Only one edge connecting the root with other nodes
C:Only one edge entering each node except for the root
D:Only one edge entering each node including the root