Stacking–estimating equality for finite connected trees

Let $T$ be a finite connected tree. Stacking–estimating conjecture.

$$\operatorname{stack}(T)=\operatorname{estim}(T).$$

The statement is presented as an immediate consequence of the preceding theorem under ASH, which gives the corresponding upper bound. The equality remains unresolved in the supplied source context.