What if you want to count paths from a single source to any of several destinations?
Run the DP once, then sum dp[u] for all destination nodes. For example, if destinations are nodes , , and , the answer is dp[7] + dp[8] + dp[9]. Each destination's count is independent. This works because paths to different destinations do not interfere with each other. You are adding up separate counts.