Sidorenko inequality for trees

Every tree $T$ satisfies the Sidorenko conjecture. If a bipartite host graph has edge density $\alpha$, then a uniformly random bipartition-respecting map from a $k$-vertex tree into the host is a graph homomorphism with probability at least ${\alpha }^{k-1}$.