We consider the branching interlacement model introduced by Zhu as an analog of Sznitman's random interlacement for branching random walks. We show that two points of the interlacement are connected via at most $\lceil d/4 \rceil$ trajectories of the interlacement, using a different proof than Procaccia and Zhang. This upper bound is sharp, in the sense that almost surely there exist two points not connected by $\lceil d/4\rceil - 1$ trajectories. We extend this result by proving that $k$ points of the interlacement are connected via at most $\lceil d(k-1)/4\rceil -(k-2)$ trajectories, and that this bound is also sharp.