New Year Santa Network（树形dp，期望，贡献，好题）

https://cn.vjudge.net/contest/312853#problem/F

New Year is coming in Tree World! In this world, as the name implies, there are ncities connected by n - 1 roads, and for any two distinct cities there always exists a path between them. The cities are numbered by integers from 1 to n, and the roads are numbered by integers from 1 to n - 1. Let's define d(u, v) as total length of roads on the path between city u and city v.

As an annual event, people in Tree World repairs exactly one road per year. As a result, the length of one road decreases. It is already known that in the i-th year, the length of the ri-th road is going to become wi, which is shorter than its length before. Assume that the current year is year 1.

Three Santas are planning to give presents annually to all the children in Tree World. In order to do that, they need some preparation, so they are going to choose three distinct cities c1, c2, c3 and make exactly one warehouse in each city. The k-th (1 ≤ k ≤ 3) Santa will take charge of the warehouse in city ck.

It is really boring for the three Santas to keep a warehouse alone. So, they decided to build an only-for-Santa network! The cost needed to build this network equals to d(c1, c2) + d(c2, c3) + d(c3, c1) dollars. Santas are too busy to find the best place, so they decided to choose c1, c2, c3 randomly uniformly over all triples of distinct numbers from 1 to n. Santas would like to know the expected value of the cost needed to build the network.

However, as mentioned, each year, the length of exactly one road decreases. So, the Santas want to calculate the expected after each length change. Help them to calculate the value.

Input

The first line contains an integer n (3 ≤ n ≤ 105) — the number of cities in Tree World.

Next n - 1 lines describe the roads. The i-th line of them (1 ≤ i ≤ n - 1) contains three space-separated integers ai, bi, li (1 ≤ ai, bi ≤ n, ai ≠ bi, 1 ≤ li ≤ 103), denoting that the i-th road connects cities ai and bi, and the length of i-th road is li.

The next line contains an integer q (1 ≤ q ≤ 105) — the number of road length changes.

Next q lines describe the length changes. The j-th line of them (1 ≤ j ≤ q) contains two space-separated integers rj, wj (1 ≤ rj ≤ n - 1, 1 ≤ wj ≤ 103). It means that in the j-th repair, the length of the rj-th road becomes wj. It is guaranteed that wjis smaller than the current length of the rj-th road. The same road can be repaired several times.

Output

Output q numbers. For each given change, print a line containing the expected cost needed to build the network in Tree World. The answer will be considered correct if its absolute and relative error doesn't exceed 10 - 6.

Examples

Input

3
2 3 5
1 3 3
5
1 4
2 2
1 2
2 1
1 1

Output

14.0000000000
12.0000000000
8.0000000000
6.0000000000
4.0000000000

Input

6
1 5 3
5 3 2
6 1 7
1 4 4
5 2 3
5
1 2
2 1
3 5
4 1
5 2

Output

19.6000000000
18.6000000000
16.6000000000
13.6000000000
12.6000000000

Note

Consider the first sample. There are 6 triples: (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), (3, 2, 1). Because n = 3, the cost needed to build the network is always d(1, 2) + d(2, 3) + d(3, 1) for all the triples. So, the expected cost equals to d(1, 2) + d(2, 3) + d(3, 1).

题意：

一棵树,n个节点，编号为1~n，n-1条边按输入的顺序编号为1~n-1，给出n-1条边的权值

在树上任意选择3个点c1,c2,c3（不互相同），则连接这3个点的总花费：

dis(c1,c2)+dis(c1,c3)+dis(c2,c3)

注意：3个点的选择是随机的

接着q个改变，

每一个改变给出i w：把第i条边的权值改为w

每一个改变后，输出现在选择3个点总花费的期望。

 

思路：考虑每一条边对期望的贡献，

在任意一种情况中，一条边要么没有被经过，要么被经过了2次（可以自己画画，不难发现）

设某条边的端点为u，v，该边要想被经过，那么要在u那边选2个点，在v那边选1个点，或者在u那边选1一个点，在v那边选两个点，然后根据组合数求出经过该边的情况数p[id],

因为每种情况里面每条边会算2次所以该边对最终期望的贡献是   p[id]*2*w[id]/C(n,3)            (C(n,3)是总的情况数）

2*C(n,3)是个常数，可以放在最后乘

每次更新都是每条边的权值减少，那么只要减去减少的期望就可以了，同时更新该边的权值

 

//木鲲上树，永无bug 
#include<bits/stdc++.h>
//#include<cstdio>
//#include<algorithm>
//#include<cstring>
//#include<map>
//#include<iostream>
#pragma GCC optimize(3)
#define max(a,b) a>b?a:b
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n;
ll c[N][4];
struct node{
	int v,w,next;
}e[N<<1];
int head[N],tot=0;
void init(int n){
	tot=0;
	for(int i=0;i<=n;i++) head[i]=-1;
}
void add(int u,int v,int w){
	e[tot].v=v;
	e[tot].w=w;
	e[tot].next=head[u];
	head[u]=tot++;
	e[tot].v=u;
	e[tot].w=w;
	e[tot].next=head[v];
	head[v]=tot++;
}
ll C(int n,int m){
	if(c[n][m]) return c[n][m];
	ll up=1,down=1;
	for(int i=0;i<m;i++){
		up*=(n-i);
		down*=(i+1);
	}
	return c[n][m]=up/down;
}
int num[N];
double ans=0;
ll p[N];//经过某边的情况数
void dfs(int u,int fa){
	num[u]=1;
	for(int i=head[u];~i;i=e[i].next){
		if(e[i].v==fa) continue;
		dfs(e[i].v,u);
		int id;
		if(i&1) id=(i+1)>>1;
		else id=(i>>1)+1;
		p[id]=C(num[e[i].v],1)*C(n-num[e[i].v],2)+C(num[e[i].v],2)*C(n-num[e[i].v],1);
		ans+=1.0*p[id]*e[i].w;
		num[u]+=num[e[i].v];
	}
}
int main(){
	ios::sync_with_stdio(false);
    cout.tie(NULL);
    scanf("%d",&n);
    init(n);
    ans=0;
    for(int i=1;i<n;i++){
    	int u,v,w;
    	scanf("%d%d%d",&u,&v,&w);
    	add(u,v,w);
	}
	dfs(1,0);
	int q;
	scanf("%d",&q);
	double K=2.0/C(n,3);
	while(q--){
		int id,w;
		scanf("%d%d",&id,&w);
		int index=(id-1)<<1;
		ans-=p[id]*(e[index].w-w);
		e[index].w=w;
		printf("%.10f\n",K*ans);
	}
	return 0;
}