The safe edge added to A (subset of an MST) in Kruskal’s algorithm is always the least weight edge in the graph that connects two unique components. As a result, negative weight edges will have no effect on the algorithm’s progress.