In this note, we prove that on any graph of maximal degree $d$ the mixing time of the Glauber Dynamics for the Ising Model at $β_c=\tanh^{-1}(\frac1{d-1})$, the uniqueness threshold on the infinite $d$-regular tree, is at most polynomial in $n$. The proof follows by a simple combination of new log-Sobolev bounds of Bauerschmidt and Dagallier, together with the tree of self avoiding walks construction of Weitz. While preparing this note we became aware that Chen, Chen, Yin and Zhang recently posted another proof of this result. We believe the simplicity of our argument is of independent interest.