We prove that a finite, connected, singly connected, locally convex higher-rank tree whose $1$-skeleton is planar and which is \emph{non-degenerate}, in the sense that every edge of each colour forms a commuting square with every other colour, has rank at most four. Under these hypotheses this establishes the planarity conjecture stated in \cite{Pask}. The obstruction side of the argument uses only the non-planarity of $K_5$; it makes no appeal to the four-colour theorem. The engine is a monotonicity property of the set of colours emitted at a vertex (``backward propagation''), which forces, in any finite singly connected non-degenerate $k$-graph, a single vertex emitting all $k$ colours; once $k\ge 5$, local convexity manufactures a subdivision of $K_5$ at such a vertex.