Decomposing a signed graph into rooted circuits

We prove a precise min-max theorem for the following problem. Let $G$ be an Eulerian graph with a specified set of edges $S\subseteq E(G)$, and let $b$ be a vertex of $G$. Then what is the maximum integer $k$ so that the edge-set of $G$ can be partitioned into $k$ non-zero $b$-trails? That is, each trail must begin and end at $b$ and contain an odd number of edges from~$S$. This theorem is motivated by a connection to vertex-minors and yields two conjectures of Máčajová and Škoviera as corollaries.