给定一棵树,询问次数与节点数都在4e5,每次询问两个节点k,m,求∑i=1ndis(lca(k,i),m)\sum_{i=1}^{n}{dis(lca(k,i),m)}∑i=1ndis(lca(k,i),m)