Summary: The largest possible multiplicity of an eigenvalue of a spectral problem generated by the Stieltjes string equations on a metric tree is \(p_{pen}-1\), where \(p_{pen}\) is the number of pendant vertices. We propose how to find the second largest possible multiplicity of an eigenvalue of such a problem. This multiplicity depends on the numbers of point masses on the edges of the trees.