#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

bool Mbe;
constexpr int K = 17;
constexpr int N = 1e5 + 5;

ll dep[N];
int u[N], v[N], w[N];
int n, q, dn, lg[N], dfn[N], mi[K][N];
struct edge {
  int id, to, val;
};
vector<edge> e[N];
int get(int x, int y) {
  return dep[x] < dep[y] ? x : y;
}
int lca(int u, int v) {
  if(u == v) return u;
  if((u = dfn[u]) > (v = dfn[v])) swap(u, v);
  int d = lg[v - u++];
  return get(mi[d][u], mi[d][v - (1 << d) + 1]);
}
ll dis(int u, int v) {
  return dep[u] + dep[v] - 2 * dep[lca(u, v)];
}
ll dise(int x, int e) {
  return max(dis(x, u[e]), dis(x, v[e]));
}
void dfs(int id, int ff) {
  mi[0][dfn[id] = ++dn] = ff;
  for(edge _ : e[id]) {
    int it = _.to;
    if(it != ff) dep[it] = dep[id] + _.val, dfs(it, id);
  }
}

int R, sz[N], mx[N], vis[N];
int fa[N], ddep[N];
void findr(int id, int ff, int tot) {
  sz[id] = 1, mx[id] = 0;
  for(edge _ : e[id]) {
    int it = _.to;
    if(it == ff || vis[it]) continue;
    findr(it, id, tot), sz[id] += sz[it];
    mx[id] = max(mx[id], sz[it]);
  }
  mx[id] = max(mx[id], tot - sz[id]);
  if(mx[id] < mx[R]) R = id;
}

vector<pair<ll, int>> c[N], cfa[N];
void findv(int id, int ff, int anc) {
  for(edge _ : e[id]) {
    int it = _.to;
    if(it == ff) continue;
    c[anc].push_back({dis(anc, it), 0});
    if(fa[anc]) cfa[anc].push_back({dise(fa[anc], _.id), 0});
    if(!vis[it]) findv(it, id, anc);
  }
}
void add(int id, ll x, vector<auto> &c) {
  if(x < 0) return;
  x = upper_bound(c.begin(), c.end(), make_pair(x, N)) - c.begin() - 1;
  while(x) c[x].second++, x -= x & -x;
}
ll query(int id, ll x, vector<auto> &c) {
  x = lower_bound(c.begin(), c.end(), make_pair(x, -N)) - c.begin();
  int s = 0;
  while(x < c.size()) s += c[x].second, x += x & -x;
  return s;
}
void divide(int id) {
  vis[id] = 1;
  c[id].push_back({-LONG_LONG_MAX, 0});
  cfa[id].push_back({-LONG_LONG_MAX, 0});
  findv(id, 0, id);
  sort(c[id].begin(), c[id].end());
  sort(cfa[id].begin(), cfa[id].end());
  for(edge _ : e[id]) {
    int it = _.to;
    if(vis[it]) continue;
    R = 0, findr(it, id, sz[it]);
    fa[R] = id, ddep[R] = ddep[id] + 1;
    divide(R);
  }
}

void add(int x, int R) {
  for(int u = x; u; u = fa[u]) {
    add(u, R - dis(x, u), c[u]);
    if(fa[u]) add(u, R - dis(x, fa[u]), cfa[u]);
  }
}
int query(int id) {
  int x = ddep[u[id]] > ddep[v[id]] ? u[id] : v[id];
  int ans = 0;
  for(int u = x; u; u = fa[u]) {
    ans += query(u, dise(u, id), c[u]);
    if(fa[u]) ans -= query(u, dise(fa[u], id), cfa[u]);
  }
  return ans;
}

bool Med;
int main() {
  fprintf(stderr, "%.3lf MB\n", (&Mbe - &Med) / 1048576.0);
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin); 
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  cin >> n;
  for(int i = 1; i < n; i++) {
    cin >> u[i] >> v[i] >> w[i];
    e[u[i]].push_back({i, v[i], w[i]});
    e[v[i]].push_back({i, u[i], w[i]});
  }
  dfs(1, 0);
  for(int i = 2; i <= n; i++) lg[i] = lg[i >> 1] + 1;
  for(int i = 1; i <= lg[n]; i++)
    for(int j = 1; j + (1 << i) - 1 <= n; j++)
      mi[i][j] = get(mi[i - 1][j], mi[i - 1][j + (1 << i - 1)]);
  mx[0] = N, findr(1, 0, n);
  divide(R);
  cin >> q;
  for(int i = 1; i <= q; i++) {
    char op;
    int u, v;
    cin >> op >> u;
    if(op == '+') cin >> v, add(u, v);
    else cout << query(u) << "\n";
  }
  cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
  return 0;
}