We consider the weighted maximum multiflow problem with respect to terminal weight µ. We show that if the dimension of the tight span associated with µ is at most 2, then there exists a 1/12-integral optimal multiflow in the µ-weighted maximum multiflow problem for every Eulerian supply graph. This result solves a weighted generalization of Karzanov's conjecture for classifying commodity graphs H with finite fractionality. Also we prove the existence of an integral or half-integral optimal multiflow for a larger class of Eulerian multiflow maximization problems including previously known classes, and give a strongly polynomial time algorithm to find it.