The problem of computing the best tree is NPcomplete (Sima'an, 1996).
if the weighted regular tree automaton corresponding to the wRTG is deterministic, every tree has only one derivation, and thus computing best trees becomes easy again.