Let $\Gamma$ be a connected simply laced finite Dynkin diagram with a unique branch vertex $v_0$, meaning that $v_0$ has degree $3$ and every other vertex has degree at most $2$. Suppose the three simple paths issuing from $v_0$ contain respectively $p$, $q$, and $r$ vertices, counting $v_0$ in each path. Then