KöMaL 2022 B5227

Give an example of a positive integer $k$, along with a finite tree graph $F$ of at least $k$ vertices in which the degree of each vertex is at most 3, and $F$ will fall apart into at least $2022$ components if an arbitrary connected subgraph of $k$ vertices is deleted from $F$.