A graph $G$ has a degree sequence $(d_1, d_2, \dots, d_n)$. If $G$ is a forest, what is the maximum possible value of the sum of the squares of the degrees?