We analyze TIMBER, a game played on graphs. We find the \(\mathcal{P}\) positions for both normal and misère play on paths and show how to win the game. In passing, we also show a correspondence with Dyck paths, the Catalan, and Fine numbers. We present an algorithm for winning the Normal Play game on trees.