（是非題）Given a strongly connected graph (i.e. a tree with only one strongly connected component), we can find a trace that traverses from a starting vertex, goes through each edge exactly once, and terminates at the starting vertex.