#include<bits/stdc++.h>
using namespace std;
#define TY int
#define IL inline
#define pb push_back
#define MAXN 200005
#define mod (TY)(1e9+7)
#define INF (TY)(1e9)
#define For(i,a,b) for(TY i=(a);i<=(b);++i)
#define FOR(i,a,b) for(TY i=(a);i<(b);++i)
#define Rof(i,a,b) for(TY i=(a);i>=(b);--i)
#define ROF(i,a,b) for(TY i=(a);i>(b);--i)
IL TY qr(){
    TY u=0,v=1;char ch=getchar();
    while(ch>'9'||ch<'0')v=(ch=='-'?-1:1),ch=getchar();
    while(ch>='0'&&ch<='9')u=(u*10)+(ch-'0'),ch=getchar();
    return u*v;
}IL void qw(TY now){
    if(now<0){putchar('-');now=-now;}
    if(!now){putchar('0');return;}
    if(now>=10)qw(now/10);putchar(now%10+'0');
}IL void qw(TY now,char ch){qw(now);putchar(ch);}
IL bool ischar(char u){return (u>='a'&&u<='z')||(u>='A'&&u<='Z');}
IL char getc(){
    char u=getchar();
    while(!ischar(u))u=getchar();
    return u;
}IL string qs(){
    string s="";char ch=getchar();
    while(!ischar(ch))ch=getchar();
    while(ischar(ch))s+=ch,ch=getchar();
    return s;
}IL void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
IL TY Pow(TY a,TY b){
    TY ans=1,base=a;
    while(b){
        if(b&1)ans=ans*base%mod;
        base=base*base%mod;b>>=1;
    }return ans;
}IL TY Mod(TY u){return (u>=mod?u-mod:u);}
TY n,m,siz[MAXN],deep[MAXN],father[MAXN],son[MAXN],top[MAXN],ans[MAXN],id[MAXN],seg[MAXN],cnt;
TY rt,S,maxx[MAXN];
bool vis[MAXN];
vector<TY> e[MAXN];
struct node{TY d,op,id;};
IL bool cmp(node x,node y){return x.d<y.d;}
vector<node> q1[MAXN],q2[MAXN],q3[MAXN];
IL void Pb(TY i,TY j){e[i].pb(j);e[j].pb(i);}
struct Tree{
    TY tree[MAXN];
    stack<TY> use;
    IL void clear(){
        while(!use.empty())tree[use.top()]=0,use.pop();
    }IL void add(TY now,TY w){
        ++now;
        while(now<=n+1){
            tree[now]+=w;
            use.push(now);
            now+=(now&-now);
        }
    }IL TY query(TY now){
        ++now;
        TY sum=0;
        while(now){
            sum+=tree[now];
            now-=(now&-now);
        }return sum;
    }IL TY query(TY l,TY r){
        if(l>r)return 0;
        else return query(r)-query(l-1);
    }
}tr;
void dfs1(TY now,TY fa){
    TY nowson=-1;
    siz[now]=1;
    deep[now]=deep[fa]+1;
    father[now]=fa;
    FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(y==fa)continue;
        dfs1(y,now);
        siz[now]+=siz[y];
        if(siz[y]>nowson){nowson=siz[y];son[now]=y;}
    }
}void dfs2(TY now,TY topf){
    id[now]=++cnt;
    seg[cnt]=now;
    top[now]=topf;
    if(!son[now])return;
    dfs2(son[now],topf);
    FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(y==father[now]||y==son[now])continue;
        dfs2(y,y);
    }
}TY LCA(TY x,TY y){
    while(top[x]!=top[y]){
        if(deep[top[x]]<deep[top[y]])swap(x,y);
        x=father[top[x]];
    }if(deep[x]>deep[y])swap(x,y);
    return x;
}void query(TY u,TY v,TY d,TY id){
    TY z=LCA(u,v);
    if(u!=z)q2[u].pb({d,1,id});
    if(v!=z)q2[v].pb({d,1,id});
    while(top[u]!=top[v]){
        if(deep[top[u]]<deep[top[v]])swap(u,v);
        q1[father[u]].pb({d,1,id});
        q1[father[top[u]]].pb({d,-1,id});
        u=top[u];
        if(father[u]!=z){
            q2[father[u]].pb({d,1,id});
            q2[u].pb({d-1,-1,id});
        }else q2[u].pb({d-1,-1,id});
        u=father[u];
    }if(deep[u]>deep[v])swap(u,v);
    if(u!=v){
        q1[father[v]].pb({d,1,id});
        q1[u].pb({d,-1,id});
        q2[son[u]].pb({d-1,-1,id});
    }q3[z].pb({d,1,id});
}void dfs3(TY now,TY fa){
    vector<TY> have;
    FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(y==fa||y==son[now])continue;
        For(j,id[y],id[y]+siz[y]-1)have.pb(deep[seg[j]]);
    }sort(have.begin(),have.end());
    sort(q1[now].begin(),q1[now].end(),cmp);
    TY tmp=0;
    FOR(i,0,q1[now].size()){
        while(tmp<have.size()&&have[tmp]<=q1[now][i].d)++tmp;
        ans[q1[now][i].id]+=q1[now][i].op*tmp;
    }FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(y==fa)continue;
        dfs3(y,now);
    }
}void dfs4(TY now,TY fa){
    FOR(i,0,q2[now].size()){
        if(q2[now][i].d<0)continue;
        ans[q2[now][i].id]-=q2[now][i].op*tr.query(deep[now],deep[now]+q2[now][i].d);
    }tr.add(deep[now],1);
    FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(y==fa)continue;
        dfs4(y,now);
    }FOR(i,0,q2[now].size()){
        if(q2[now][i].d<0)continue;
        ans[q2[now][i].id]+=q2[now][i].op*tr.query(deep[now],deep[now]+q2[now][i].d);
    }
}void get_siz(TY now,TY fa){
    siz[now]=1;maxx[now]=0;
    FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(y==fa||vis[y])continue;
        get_siz(y,now);
        siz[now]+=siz[y];
        maxx[now]=max(maxx[now],siz[y]);
    }maxx[now]=max(maxx[now],S-siz[now]);
    if(maxx[now]<maxx[rt])rt=now;
}void get_ans(TY now,TY deep,TY fa,TY op){
    if(op==0){
        FOR(i,0,q3[now].size())ans[q3[now][i].id]+=tr.query(0,q3[now][i].d-deep);
    }else tr.add(deep,op);
    FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(y==fa||vis[y])continue;
        get_ans(y,deep+1,now,op);
    }
}void solve(TY now){
    vis[now]=1;
    get_siz(now,0);
    tr.clear();
    tr.add(0,1);
    FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(vis[y])continue;
        get_ans(y,1,now,1);
    }FOR(i,0,q3[now].size())ans[q3[now][i].id]+=tr.query(0,q3[now][i].d);
    FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(vis[y])continue;
        get_ans(y,1,now,-1);
        get_ans(y,1,now,0);
        get_ans(y,1,now,1);
    }FOR(i,0,e[now].size()){
        TY y=e[now][i];
        if(vis[y])continue;
        S=siz[y];rt=0;maxx[rt]=1e9;
        get_siz(y,now);
        solve(rt);
    }
}
int main(){
    n=qr();
    tr.add(0,1);
    cout<<tr.query(0,1)<<endl;
    FOR(i,1,n){
        TY u=qr(),v=qr();
        Pb(u,v);
    }dfs1(1,0);
    dfs2(1,1);
    m=qr();
    For(i,1,m){
        TY u=qr(),v=qr(),d=qr();
        query(u,v,d,i);
    }dfs3(1,0);
    dfs4(1,0);
    solve(1);
    For(i,1,m)qw(ans[i],'\n');
    return 0;
}
/*
6
1 2
2 3
2 4
1 5
4 6
1
2 4 1
 */