Classical matching theory such as the Gallai-Edmonds structure theorem is concerned about the multiplicities of zero roots of matching polynomial of graphs. We prove an analogue of half of the Gallai-Edmonds structure theorem (namely the so-called Stability Lemma) for non zero roots. We conjecture that the other half (analogous to Gallai's Lemma) is also true. This is a joint work with William Chen.