Note that the edge is coming from the parent to the child.
given a child node word j , we are finding the parent, or the head word i such that the edge (i, j) has the highest weight among all i, i = j.