agc016 D - XOR Replace
Problem StatementThere is a tree with N vertices, numbered 1 through N. The i-th edge in this tree connects Vertices Ai and Bi and has a length of Ci.Joisino created a complete graph with N vertic...
