Good Bye 2014 CF 500D

D. New Year Santa Network

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

New Year is coming in Tree World! In this world, as the name implies, there are n cities 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 wj is 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.

Sample test(s)

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).

/*
   题意：给你一棵树，再给出一种操作，就是将树上的一条边的权值减小，
         每次操作后要输出一个期望，这个期望是从树上任取三点a，b，c，
它们的距离和（d（a,b）+d(a,c)+d(b,c)）。
   思路： 期望就是总的长度/C(n,3),总的长度也就是每条边用的次数*这条边的权值。
          一、怎么求一条边所用的次数呢？
 1、这是一棵树，去掉这条边后就形成两棵树，随机分别从这两棵子树中选出2个和1个点，通过去掉这条边连成了3个点
 2、求出去掉某条边后，形成的两棵子树的点数分别为多少
 3、注意对于每种方案通过去掉的边2次
 4、结合1,2,3,4得出去掉某条边后形成的方案数
          二、注意事项：
 1、不能直接求总的长度，会爆long long
 2、注意运算过程中爆long long的地方
*/

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#define min(a, b)(a < b? a: b)
#define INF 99999999
#define LL __int64
using namespace std;

const int MAXN = 100010;
int k, n;
int head[MAXN], son[MAXN];
LL  num[MAXN], total;
bool f[MAXN];
double ans;

struct Ed
{
	int v, w, next;
}e[MAXN << 1];

void addEd(int u, int v, int w)
{
	e[k].v = v;
	e[k].w = w;
	e[k].next = head[u];
	head[u]=k++;
}

void read()
{
	k = 0;
	memset(head , -1 , sizeof(head));
	scanf("%d", &n);
	for(int i = 1 ; i < n ; i++)
	{
		int u, v;
		LL w;
		scanf("%d %d %d", &u, &v, &w);
		addEd(u, v, w);
		addEd(v, u, w);
	}
}

int dfscnt(int u)
{
	int sum = 0;
	f[u] = true;
	for(int i = head[u] ; i != -1 ; i = e[i].next)
	{
		if(!f[e[i].v])
			sum += dfscnt(e[i].v);
	}
	son[u] = sum + 1;
	return son[u];
}


void dfs(int u)
{
	f[u] = true;
	for(int i = head[u] ; i != -1 ; i = e[i].next)
	{
		if(!f[e[i].v])
		{
			LL cnt = (LL)son[e[i].v];
			num[i>>1] = cnt * (cnt - 1) * ((LL)n - cnt) + cnt * ((LL)n - cnt) * ((LL)n - cnt - 1);
			dfs(e[i].v);
		}
	}
}

void solve()
{
	memset(num , 0 , sizeof(num));
	memset(f , 0 , sizeof(f));
	memset(son , 0 , sizeof(son));
	dfscnt(1);
//	for(int v=1;v<=n;v++)printf("%d %d\n",v,son[v]);
	memset(f , 0 , sizeof(f));
	dfs(1);
	
	total = (LL)n * (LL)(n - 1) * (LL)(n - 2) / 6;
	ans = 0;

//	for(int j=0;j<n-1;j++)printf(" %d %I64d\n",j,num[j]);

	for(int i = 0 ; i < n - 1 ; i++)
		ans += (num[i] * e[i<<1].w + 0.0)/total;

	int Q;
	scanf("%d", &Q);
	while(Q--)
	{
		int id, w;
		scanf("%d %d", &id, &w);
		id--;
		ans -= (num[id] * (LL)(e[id<<1].w - w) + 0.0)/total;
		e[id<<1].w = w;
		printf("%.10lf\n", ans);
	}
}
int main()
{
	read();
	solve();
	//main();
    return 0;
}