Edit : I generate this test case in which your dfs will run in $$$O(n*m)$$$, the issue is your dfs update the value of each node too many time

1
2001 2000
2 1 0 2 1 0 ....
1 2
2 3
...
(simple path)