A harmonious coloring of is a proper vertex coloring of such that every pair of colors appears on at most one pair of adjacent vertices. The harmonious chromatic number of , , is the minimum number of colors needed for a harmonious coloring of . We show that if is a forest of order with maximum degree , then Moreover, the proof yields a polynomial-time algorithm for an optimal harmonious coloring of such a forest.