Two graphs $G_1,G_2$ are distinguished by the Weisfeiler--Leman isomorphism test if and only if there is a tree $T$ that has a different number of homomorphisms to $G_1$ and to $G_2$. There are two known proofs of this fact -- a logical proof by Dvorak and a linear-algebraic proof by Dell, Grohe, and Rattan. We give another simple proof, based on ordering WL-labels and asymptotic arguments.