Question: Which of the following statements about Graphs in Data Structures is correct?

A) A directed graph can have multiple edges between the same pair of vertices in a single direction.
B) In a weighted graph, the edges cannot have negative weights.
C) A graph is a tree if it is acyclic and has exactly one path between any two vertices.
D) Depth-First Search (DFS) guarantees the shortest path in an unweighted graph.