test #4, if you sort the left nodes then before updating the DP[i], you should check whether their left nodes are coincide or not.
e.g:
4
1 2
1 3
1 4
1 5
test #6: this test has n == 1, you just need to print 1 and 1 in the output.