Thank U, Next

*One taught me love \ One taught me patience \ And one taught me pain \ Now, I'm so amazing* You have an undirected graph $G$ with $N$ nodes and $M$ edges. There are $K$ mail carriers such that the $i^{th}$ carrier is initially on node $X_i$ and can deliver mail to any node having **at most** $D_i$ distance from node $X_i$. Note that the distance between two nodes is defined as the total num