In the first version of our model, we could simply set the score of each edge to be w•f (x i , x j ), and the MST recovered in this way would indeed be the highest scoring tree: arg max y P (y|x).
this straightforward approach doesn't apply to the full model which also uses sibling features.