Our obtained result extends the existing results from the special case of strongly connected balanced digraphs to the condition of general digraphs owning directed spanning trees, which is the weakest condition for synchronization from the aspect of network structure. Moreover, our adopted method is completely different from and much more elementary than the previous differential geometry method.