#include <map>
#include <ctime>
#include <array>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MAXN 110000
#define MOD
#define INF 1000000001
#define vint vector<int>
#define vLL vector<long long>
#define PII pair<int,int>
#define X first
#define Y second
#define LLL __int128_t
#define LL long long
using namespace std;
int n,m;
PII e[MAXN];
vint edge[MAXN];
vint val[MAXN];
array<int,3> que[MAXN];
map<PII,int> Cover;
void BF(int x,int fa,int r,LL d){
    if(d<=r && fa)Cover[{x,fa}]++,Cover[{fa,x}]++;
    int i=0;
    for(auto &v:edge[x]){
        if(v==fa){
            i++;
            continue;
        }
        BF(v,x,r,d+val[x][i++]);
    }
}
struct LCA{
    int fa[MAXN],siz[MAXN],son[MAXN],dep[MAXN],top[MAXN];
    LL dis[MAXN];
    LCA(){
        memset(dep,0,sizeof(dep));
        memset(fa,0,sizeof(fa));
        memset(son,0,sizeof(son));
    }
    void dfs1(int x){
        //cout<<"dis"<<x<<" "<<dis[x]<<endl;
        siz[x]=1;
        son[x]=0;
        int i=0;
        for(auto &v:edge[x]){
            if(v==fa[x]){
                i++;
                continue;
            }
            fa[v]=x;
            dep[v]=dep[x]+1;
            dis[v]=dis[x]+val[x][i++];
            dfs1(v);
            siz[x]+=siz[v];
            if(!son[x] || siz[son[x]]<siz[v])
                son[x]=v;
        }
    }
    void dfs2(int x){
        if(x==son[fa[x]]){
            top[x]=top[fa[x]];
        }
        else{
            top[x]=x;
        }
        for(auto &v:edge[x]){
            if(v!=fa[x])
                dfs2(v);
        }
    } 
    inline int lca(int x,int y){
        while(top[x]!=top[y]){
            if(dep[top[x]]<dep[top[y]])swap(x,y);
            x=fa[top[x]];
        }
        return dep[x]<dep[y]?x:y;
    }
}lca;

inline LL DIS(int x,int y){
    int c=lca.lca(x,y);
    return lca.dis[x]+lca.dis[y]-2*lca.dis[c];
}
inline int Edis(int x,int y){
    int c=lca.lca(x,y);
    return lca.dep[x]+lca.dep[y]-2*lca.dep[c];
}

struct BIT{
    vint q;
    BIT(){}
    BIT(vint &vec){
        q=vint(vec.size()+1,0);
    }
    void add(int x,int y){
        x++;
        for(int i=x;i<q.size();i+=i&-i)q[i]+=y;
    }
    int sum(int x){
        x++;
        int ret=0;
        for(int i=x;i;i-=i&-i)ret+=q[i];
        return ret;
    }
    int sum(int l,int r){
        if(l>r)return 0;
        return sum(r)-sum(l-1);
    }
    int Ge_sum(int x){
        return sum(x,(int)q.size()-2);
    }
}bit[MAXN],subit[MAXN];

bool vis[MAXN];
int siz[MAXN],max_son[MAXN];
int fa[MAXN],dep[MAXN];
vint cov[MAXN],sub[MAXN];
void Find_root(int x,int fa,vint &vec){
    siz[x]=1;
    max_son[x]=0;
    vec.push_back(x);
    for(auto &v:edge[x]){
        if(!vis[v] && v!=fa){
            Find_root(v,x,vec);
            siz[x]+=siz[v];
            max_son[x]=max(siz[v],max_son[x]);
        }
    }
}
void DivConq(int x,int f){
    vint sub;
    Find_root(x,0,sub);
    int center=0;
    for(auto &i:sub)
        if(max((int)sub.size()-siz[i],max_son[i])*2<=sub.size())
            center=i;
    fa[center]=f;
    dep[center]=dep[f]+1;
    vis[center]=1;
    for(auto &i:edge[center])
        if(!vis[i])
            DivConq(i,center);
}
void Pre_Update(int x,int y){
    for(int i=x,j=0;i;i=fa[i]){
        LL d = DIS(i,x);
        if(y>=d){
            cov[i].push_back(y-d);
            if(j)sub[j].push_back(y-d);
        }
        j=i;
    }
}

void Pre(){
    scanf("%d",&m);
    //m=5;printf("%d\n",m);
    for(int i=1;i<=m;i++){
        char s[3];
        int x,y;
        scanf("%s",s);
        //s[0]=(rand()&1)?'+':'?';putchar(s[0]);putchar(' ');
        if(s[0]=='+'){
            scanf("%d%d",&x,&y);
            //x=rand()%n+1;y=rand()%20;printf("%d %d\n",x,y);
            que[i]={1,x,y};
            Pre_Update(x,y);
        }
        else{
            scanf("%d",&x);
            //x=rand()%(n-1)+1;printf("%d\n",x);
            que[i]={0,e[x].X,e[x].Y};
        }
    }
    for(int i=1;i<=n;i++){
        sort(cov[i].begin(),cov[i].end());
        sort(sub[i].begin(),sub[i].end());
        //cout<<i<<": ";for(auto &j:cov[i])cout<<j<<" ";cout<<endl;
        bit[i]=BIT(cov[i]);
        subit[i]=BIT(sub[i]);
    }
}

inline int get_loc(vint &vec,int v){
    return lower_bound(vec.begin(),vec.end(),v) - vec.begin();
}

void Update(int x,int y){
    for(int i=x,j=0;i;i=fa[i]){
        LL d = DIS(i,x);
        if(y>=d){
            int t = y-d;
            int idx = get_loc(cov[i],t);
            bit[i].add(idx,1);
            if(j){
                idx = get_loc(sub[j],t);
                subit[j].add(idx,1);
            }
        }
        j=i;
    }
}

int Query(int u,int v){
    int ret=0;
    if(dep[u]<dep[v])swap(u,v);
    
    for(int i=u,j=0;i;i=fa[i]){
        int d;
        if(Edis(i,u)<Edis(i,v)){//U
            d = min((LL)INF,DIS(v,i));
        }
        else{//V
            d = min((LL)INF,DIS(u,i));
        }
        int idx = get_loc(cov[i],d);ret+=bit[i].Ge_sum(idx);
        if(j){
            idx = get_loc(sub[j],d);ret-=subit[j].Ge_sum(idx);
        }
        j=i;
    }
    
    return ret;
}

int main(){
    //auto seed = 1679373801;
    //srand(seed);
    //cout<<seed<<endl;
    scanf("%d",&n);
    //n=10;printf("%d\n",n);
    for(int i=1;i<n;i++){
        int x,y,z;
        scanf("%d%d%d",&x,&y,&z);
        //x=i,y=i+1,z=rand()%10;printf("%d %d %d\n",x,y,z);
        e[i] = {x,y};
        edge[x].push_back(y);val[x].push_back(z);
        edge[y].push_back(x);val[y].push_back(z);
    }
    lca.dfs1(1);
    lca.dfs2(1);
    DivConq(1,0);

    // for(int i=1;i<=n;i++){
    //     printf("fa[%d]=%d",i,fa[i]);
    // }

    Pre();

    for(int i=1;i<=m;i++){
        if(que[i][0]){
            Update(que[i][1],que[i][2]);
            //BF(que[i][1],0,que[i][2],0);
        }
        else{
            printf("%d\n",Query(que[i][1],que[i][2]));
        }
    }



    return 0;
}