import sys readline = sys.stdin.readline def decomposition(Edge, st = 0): N = len(Edge) bfsorder = [st] for i in range(N): vn = bfsorder[i] for vf in Edge[vn]: Edge[vf].remove(vn) bfsorder.extend(Edge[vn]) sset = [0]*N for vn in bfsorder[::-1]: se = st = 0 for vf in Edge[vn]: st |= sset[vf]&se se |= sset[vf] tmp = ~se & -(1< lv: used[i] = 1 for vn in range(N): if levels[vn] != lv: continue used[vn] = 1 dsum = 0 ssum = 0 stack = [] for vf, w in Edge[vn]: if used[vf]: continue color[vf] = vf ssum += 1 size[vf] = 1 used[vf] = 1 dist[vf] = w dsum = (dsum + w)%MOD ds[vf] = w ds2[vf]= w*w%MOD stack.append(vf) cs = stack[:] while stack: vn = stack.pop() for vf, w in Edge[vn]: if used[vf]: continue used[vf] = 1 c = color[vn] color[vf] = c dist[vf] = (dist[vn] + w)%MOD ds[c] = (ds[c] + dist[vf])%MOD dsum = (dsum + dist[vf])%MOD ds2[c] = (ds2[c] + dist[vf]*dist[vf])%MOD size[c] += 1 ssum += 1 stack.append(vf) ans = (ans + dsum*dsum)%MOD for r in cs: ans = (ans + ds2[r] + (ssum-size[r])*ds2[r] - ds[r]*ds[r])%MOD print(ans)