  We study the weighted generalization of the edge coloring problem where the
weight of each color class (matching) equals to the weight of its heaviest edge
and the goal is to minimize the sum of the colors' weights. We present a
3/2-approximation algorithm for trees.
