We formulate a restriction of Hindman’s Finite Sums Theorem in which monochromaticity is required only for sums corresponding to rooted finite paths in the full binary tree. We show that the resulting principle is equivalent to \-induction over \. The proof uses the equivalence of this Hindman-type theorem with the Pigeonhole Principle for trees \ with an extra condition on the solution tree.