These results support the hypothesis that dependency edges are usually more meaningful for relation extraction than word adjacency.
if adjacency edges get the same weights, they might cause some dependency sub-paths drop out of the top K paths, thus degrading performance.