About the features of tree, “there is only one path between any nodes” equals the following statements ( ).
选项：

A:no cycle and the number of edges =N-1
B:connected and the number of edges =N
C:no cycle, but adding an edge leads to a unique cycle
D:connected but not connected if discarding one edge