Let $G = (V, E)$ be a directed graph represented using adjacency lists without edge weights. A standard Breadth-First Search (BFS) is run from a source vertex $s$, producing distance labels $d[v]$ for all reachable vertices $v$. Which of the following statements is always true?