Recently, Zhang and Wu proved a conjecture of Kalai and Meshulam, showing that for every graph $G$ without induced cycles of length divisible by $3$, the sum of all reduced Betti numbers of its independence complex $I(G)$ is at most $1$. We extend this result to the hypergraph setting. Namely, we show that the same conclusion holds for any hypergraph $H$ that does not contain a Berge cycle of length divisible by $3$. This establishes a broader connection between forbidden cycle structures and the topological simplicity of independence complexes. As a key tool, we introduce a hypergraph analogue of Barmak's star cluster theorem for graphs. This new theorem implies, in particular, that if a hypergraph $H$ has a vertex $v$ that is not isolated and is not contained in an induced Berge cycle of length $3$, then there exists a hypergraph $H'$ with fewer vertices than $H$ such that the independence complex of $H$ is homotopy equivalent to the suspension of the independence complex of $H'$.