Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier