Finding most likely tree over a semilattice
The maximum spanning tree is about summing weights; maximizing the probability is about multiplying weights.  To convert multiplication to sums, take the logarithm.

Hopefully that's enough for you to work out an algorithm for this task.