This talk considers the following question at the intersection of extremal and structural graph theory: What is the maximum number of copies of a fixed forest in an -vertex graph in a graph class as ? I will answer this question for a variety of sparse graph classes . In particular, we show that the answer is where is the size of the largest stable set in the subforest of induced by the vertices of degree at most , for some integer that depends on . For example, when is the class of -degenerate graphs then ; when is the class of graphs containing no -minor () then ; and when is the class of -planar graphs then . All these results are in fact consequences of a single lemma in terms of a finite set of excluded subgraphs. This is joint work with Tony Huynh (arXiv:2009.12989).