The reasoning is that we use one tree to capture long distance information and the other two to capture coordination information.
7 we decompose each given graph y y y into three tree-like subgraphs g g g 1 , g g g 2 , and g g g 3 for each subgraph to carry important information of the graph as well as cover all edges in y y y.