Mixtures of star trees and deficiency graphs

The star tree rank of a matrix A is the smallest k for which A is an entrywise minimum of k distance matrices of weighted trees without internal edges. The deficiency graph of A has an edge connecting (i,j) and (k,l) if and only if Aij+Akl