An algorithm is proposed to obtain minimum tree representation of a chordal graph on an algorithm obtained in Ref.(5), and we prove that any tree obtained by this algorithm is optimal for two kinds of optimization problems, that is 1) to obtain a clique tree with the minimum sum of weights on edges and 2) to obtain a clique tree with the minimum sum of weights of subtrees corresponding to vertices.