This is my problem...

Let F be a forest with degree sequence (1,....1, 2, 3, 5, 7, 11, 13). Assuming that F has 3 components, what is the number of end vertices of F?

I've drawn a tree with 3 components and my picture has 41 vertices. There are 6 vertices that have degree > 1. I'm certain this is true but I think there might be a formula to prove this is true but my Wilson book isn't helping me very much. If anyone has any idea, let me know. Thank you.