#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
//#define int long long

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cmplx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}

typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> orderTree;

struct Event {
    bool type;
    int t, v;
    int d, root;

    bool operator<(const Event &e) const {
        return t < e.t;
    }
};

ostream& operator<<(ostream &os, Event e){
    return os << "{" << e.type << ' ' << e.t << ' ' << e.v << ' ' << e.d << ' ' << e.root << "}";
}

struct Edge {
    int n2, c, i;
};

const int MN = 1e5 + 5;
int n, q;
vector<Edge> adjList[MN];
vector<Event> qs[MN], upds[MN];
bool removed[MN];
int ans[MN];

int stSz[MN];

void dfs(int n1, int par){
    stSz[n1] = 1;
    for(Edge e : adjList[n1]){
        if(e.n2 != par && !removed[e.n2]){
            dfs(e.n2, n1);
            stSz[n1] += stSz[e.n2];
        }
    }
}

int findCent(int n1, int par, int osz){
    for(Edge e : adjList[n1]){
        int n2 = e.n2;
        if(n2 != par && !removed[n2] && stSz[n2] >= osz/2) return findCent(n2, n1, osz);
    }
    return n1;
}

vector<Event> events;

void dfs1(int n1, int par, int d1, int root){
    if(d1 > INF) return;

    for(Event e : upds[n1]){
        events.pb({e.type, e.t, e.v, d1, root});
    }

    for(Edge edge : adjList[n1]){
        int n2 = edge.n2;
        int d2 = d1+edge.c;
        if(n2 == par) continue;

        for(Event e : qs[edge.i]){
            events.pb({e.type, e.t, e.v, d2, root});
        }
        if(!removed[n2]) dfs1(n2, n1, d2, root);
    }
}

void solve(int init){
    dfs(init, -1);
    int cent = findCent(init, -1, stSz[init]);

    orderTree mainTree;
    vector<orderTree> sideTrees;

    for(Edge edge : adjList[cent]){
        int n2 = edge.n2;
        int d2 = edge.c;
        int root = SZ(sideTrees);

        for(Event e : qs[edge.i]){
            events.pb({e.type, e.t, e.v, d2, root});
        }

        if(!removed[n2]) dfs1(n2, cent, d2, root);
        sideTrees.pb({});
    }

    for(Event e : upds[cent]){
        events.pb({e.type, e.t, e.v, 0, SZ(sideTrees)});
    }
    sideTrees.pb({});

    sort(ALL(events));
    //dbg(cent);
    //dbgArr(events, SZ(events));

    for(Event e : events){
        if(e.type == 0){
            if(e.d >= e.v) continue;
            mainTree.insert({e.v-e.d, SZ(mainTree)});
            sideTrees[e.root].insert({e.v-e.d, SZ(sideTrees[e.root])});
        }
        else {
            ans[e.t] += SZ(mainTree) - mainTree.order_of_key({e.d, -1});
            ans[e.t] -= SZ(sideTrees[e.root]) - sideTrees[e.root].order_of_key({e.d, -1});
            //dbg(ans[e.t]);
        }
    }

    events.clear();
    removed[cent] = true;
    for(Edge e : adjList[cent]){
        int n2 = e.n2;
        if(!removed[n2]) solve(n2);
    }
}

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    cin >> n;
    assert(n < MN);

    FR(i, n-1){
        int a, b, c;
        cin >> a >> b >> c;
        a--; b--;
        adjList[a].pb({b, c, i});
        adjList[b].pb({a, c, i});
    }

    cin >> q;
    assert(q < MN);

    FR(i, q){
        char ch; cin >> ch;
        if(ch == '+'){
            int a, v;
            cin >> a >> v;
            a--;
            upds[a].pb({0, i, v});
            ans[i] = -1;
        }
        else {
            assert(ch == '?');
            int a; cin >> a; a--;
            assert(a < n-1);
            qs[a].pb({1, i, -1});
        }
    }

    solve(0);
    FR(i, q) if(ans[i] != -1) cout << ans[i] << '\n';
}