A very short proof of Sidorenko's inequality for counts of homomorphism between graphs

We provide a very elementary proof of a classical extremality result due to Sidorenko (Discrete Math.\ 131.1-3, 1994), which states that among all graphs $G$ on $k$ vertices, the $k-1$-edge star maximises the number of graph homomorphisms of $G$ into any graph $H$.