The collection of branches (maximal linearly ordered sets of nodes) of the tree $^{<\omega}\omega$ (ordered by inclusion) forms an almost disjoint family (of sets of nodes). This family is not maximal--for example, any level of the tree is almost disjoint from all of the branches. How many sets must be added to the family of branches to make it maximal? This question leads to a series of definitions and results: a set of nodes is off-branch if it is almost disjoint from every branch in the tree; an off-branch family is an almost disjoint family of off-branch sets; and $\mathfrak{o}$ is the minimum cardinality of a maximal off-branch family. Results concerning $\mathfrak{o}$ include: (in ZFC) $\mathfrak{a \leq p}$, and (consistent with ZFC) $\mathfrak{o}$ is not equal to any of the standard small cardinal invariants $\mathfrak{b,a,d}$, or $\mathfrak{c} = 2^\omega$. Most of these consistency results use standard forcing notions--for example, $\mathfrak{b = a < o = d = c}$ in the Cohen model. Many interesting open questions remain, though--for example, whether $\mathfrak{d \leq o}$.