I think the answer should be 9. As it is a tree, the degree of a node/vertex is the number of child nodes it has and the parent is not taken into consideration. Thus, Handshaking lemma can not be applied as it is not a graph.
Try arranging the nodes in any way possible the summation of degrees of all the node will equal to (n-1) for a tree with n nodes.