This problem asks about nodes at a specific depth, which suggests Euler Tour (you can flatten depth ranges). But it also mentions LCA, which suggests ancestor preprocessing with binary lifting.
Can you use only one technique, or do you need both working together? How do you count nodes at depth d whose LCA with v is at depth h?
Think about combining techniques: use one to filter by ancestor, another to count by depth. Pause before reading on.