Non-zero disjoint cycles in highly connected group labeled graphs

We prove that if G is a Γ-labelled graph and the corresponding undirected graph is 312k-connected, either G has k disjoint non-zero cycles or it has a vertex set Q of order at most 2k−2 such that G−Q has no non-zero cycles. The bound “2k−2” is best possible.