#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define ll long long
 
int getPrime(int N, int res[]){
  int i, a, b;
  int size = 1;
  const int range = 23000;
  bool buf[range], *isprime = buf;
  int sf[4780], ss = 1;

  N /= 2;
  res[0] = 2;
  b = min(range, N);
  REP(i,1,b) isprime[i] = 1;
  REP(i,1,b) if(isprime[i]){
    res[size++] = 2*i+1;
    sf[ss] = 2*i*(i+1);
    if(sf[ss] < N){
      while(sf[ss] < range) isprime[sf[ss]] = 0, sf[ss] += res[ss];
      ss++;
    }
  }

  for(a=range; a<N; a+=range){
    b = min(a + range, N);
    isprime -= range;
    REP(i,a,b) isprime[i] = 1;
    REP(i,1,ss){
      while(sf[i] < b) isprime[sf[i]] = 0, sf[i] += res[i];
    }
    REP(i,a,b) if(isprime[i]) res[size++] = 2*i+1;
  }

  return size;
}

int unionGet(int d[],int n){
  int t=n, k;
  while(d[t] != t) t=d[t];
  while(d[n] != n) k=d[n], d[n]=t, n=k;
  return n;
}

int unionConnect(int d[],int a,int b){
  a = unionGet(d, a);
  b = unionGet(d, b);
  if(a==b) return 0;
  d[a]=b;
  return 1;
}

int ps, p[1000100];
int mobius[1000100];
 
int N, Q;
int X[100000], Y[100000], Z[100000];
int A[200], C[200];
 
ll res[210];
 
int ind[100000], sz[100000];
int ind2[100000], sz2[100000];
int used[100000], stk[100000], sts, used2[100000], stk2[100000], sts2;
 
vector<int> edges[1000001];
vector<int> edge2[1000001];
int fac[10000], facc, facp[10000];
 
int change_fg[100000];
int sest[1000], sests;
 
void get_factors(int k){
  int i, j, m, sz = 0;
 
  rep(i,ps){
    if(p[i]*p[i] > k) break;
    if(k%p[i]==0){
      facp[sz++] = p[i];
      while(k%p[i]==0) k /= p[i];
    }
  }
  if(k > 1) facp[sz++] = k;
 
  facc = 0;
  REP(i,1,1<<sz){
    m = 1;
    rep(j,sz) if(i&1<<j) m *= facp[j];
    fac[facc++] = m;
  }
}
 
 
int main(){
  int i, j, k, m, q, start, mind, cg;
  ll cur, add;
 
  ps = getPrime(1000100, p);
  rep(i,1000100) mobius[i] = 1;
 
  rep(i,ps) for(j=p[i];j<1000100;j+=p[i]) mobius[j] *= -1;
  rep(i,ps){
    if(p[i]*p[i] >= 1000100) break;
    for(j=p[i]*p[i];j<1000100;j+=p[i]*p[i]) mobius[j] = 0;
  }

  scanf("%d",&N);
  rep(i,N-1) scanf("%d%d%d",X+i,Y+i,Z+i), X[i]--, Y[i]--;
  scanf("%d",&Q);
  rep(i,Q) scanf("%d%d",A+i,C+i), change_fg[--A[i]] = 1;

  rep(i,N-1){
    get_factors(Z[i]);
    rep(j,facc){
      m = fac[j];
      edges[m].push_back(i);
    }
  }
  rep(i,Q){
    get_factors(C[i]);
    rep(j,facc){
      m = fac[j];
      edge2[m].push_back(i);
    }
  }
  
  rep(i,N) ind[i] = i, sz[i] = 1;
  
  rep(q,Q+1) res[q] = (ll)N * (N-1) / 2;
  REP(k,2,1000001) if(edges[k].size() + edge2[k].size()){
    add = 0;
    while(sts>0) sts--, used[stk[sts]]=0, sz[stk[sts]] = 1, ind[stk[sts]] = stk[sts];
    sests = 0;
    rep(m,edges[k].size()){
      i = X[edges[k][m]];
      j = Y[edges[k][m]];
      if(used[i]==0) used[i] = 1, stk[sts++] = i;
      if(used[j]==0) used[j] = 1, stk[sts++] = j;
      
      if(change_fg[edges[k][m]]){
        sest[sests++] = edges[k][m];
      } else {
        i = unionGet(ind, i);
        j = unionGet(ind, j);
        if(i==j) continue;
        add += (ll)sz[i] * sz[j];
        sz[j] += sz[i];
        unionConnect(ind, i, j);
      }
    }
    rep(m,edge2[k].size()){
      i = X[A[edge2[k][m]]];
      j = Y[A[edge2[k][m]]];
      if(used[i]==0) used[i] = 1, stk[sts++] = i;
      if(used[j]==0) used[j] = 1, stk[sts++] = j;
    }
    cur = add;
    start = 0;
 
    rep(i,sts){
      m = stk[i];
      j = unionGet(ind, m);
    }
 
    while(sts2>0) sts2--, used2[stk2[sts2]]=0;
    sts2 = 0;
    rep(m,sests){
      i = ind[X[sest[m]]];
      if(used2[i]==0) used2[i] = 1, stk2[sts2++] = i;
      i = ind[Y[sest[m]]];
      if(used2[i]==0) used2[i] = 1, stk2[sts2++] = i;
    }
    rep(m,edge2[k].size()){
      i = ind[X[A[edge2[k][m]]]];
      if(used2[i]==0) used2[i] = 1, stk2[sts2++] = i;
      i = ind[Y[A[edge2[k][m]]]];
      if(used2[i]==0) used2[i] = 1, stk2[sts2++] = i;
    }
 
    rep(q,Q+1){
      rep(i,sts2) ind2[stk2[i]] = ind[stk2[i]], sz2[stk2[i]] = sz[stk2[i]];
      add = cur;
      rep(m,sests) if(sest[m]>=0) {
        i = unionGet(ind2, ind[X[sest[m]]]);
        j = unionGet(ind2, ind[Y[sest[m]]]);
        if(i==j) continue;
        add += (ll)sz2[i] * sz2[j];
        sz2[j] += sz2[i];
        unionConnect(ind2, i, j);
      }
      res[q] += add * mobius[k];
      for(;;){
        cg = 1;
        if(q<Q){
          mind = -1;
          cg = 0;
          rep(i,sests){
            if(sest[i]==A[q]){
              if(start < edge2[k].size() && edge2[k][start] == q) start++;
              else                                                cg = 1, sest[i] = -1;
            }
            if(sest[i]==-1) mind = i;
          }
          if(start < edge2[k].size() && edge2[k][start] == q){
            cg = 1;
            start++;
            if(mind >= 0) sest[mind] = A[q]; else sest[sests++] = A[q];
          }
        }
        if(cg==0){
          q++;
          res[q] += add * mobius[k];
          continue;
        }
        break;
      }
    }
  }
  
  rep(i,Q+1) printf("%lld\n", res[i]);
 
  return 0;
}