#include<bits/stdc++.h>
using std::cin;
using std::cout;
using u64 = unsigned long long;
const int mod = 998244353;

using ll = long long;
const int N = 200005;
int n, q;
void merge(std::vector<ll> & A, std::vector<ll> & B) {
	A.insert(A.end(), B.begin(), B.end());
	inplace_merge(A.begin(), A.end() - B.size(), A.end());
}
struct ds {
	std::vector<std::vector<ll>> v;
	void adjust() {
		for(;v.size() >= 2 && v.back().size() * 8 >= v[v.size() - 2].size();) {
			merge(v[v.size() - 2], v.back()), v.pop_back();
		}
	}
	void ins(ll w) {
		v.push_back({w}), adjust();
	}
	ll leq(ll w) {
		int ans = 0;
		for(auto & x : v) {
			ans += x.end() - lower_bound(x.begin(), x.end(), w);
		}
		return ans;
	}
};
struct edge { int to, nxt, v, id; } e[N << 1];
int h[N], num;
void link(int x, int y, int v, int id) {
	e[++num] = {y, h[x], v, id}, h[x] = num;
	e[++num] = {x, h[y], v, id}, h[y] = num;
}

int size[N], vis[N];
int root, mn;
void dfs0(int x, int fa = 0) {
	size[x] = 1;
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa && !vis[e[i].to]) {
		dfs0(e[i].to, x);
		size[x] += size[e[i].to];
	}
}
void dfs1(int x, int s, int fa = 0) {
	int max = s - size[x];
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa && !vis[e[i].to]) {
		dfs1(e[i].to, s, x);
		max = std::max(max, size[e[i].to]);
	}
	if(max < mn) {
		mn = max;
		root = x;
	}
}
int getroot(int x) {
	mn = 1e9, dfs0(x), dfs1(x, size[x]);
	return root;
}
ll dep[20][N];

ds node[N], edge[N];
struct insop { ds * x; ll d; };

std::vector<insop> ops[N];
std::vector<insop> qys[N][2];


void dfs2(int x, ds * a, ds * b, ll w, int fa = 0) {
	ops[x].push_back({a, w});
	ops[x].push_back({b, w});
	for(int i = h[x];i;i = e[i].nxt) if(e[i].to != fa && !vis[e[i].to]) {
		qys[e[i].id][0].push_back({a, w + e[i].v});
		qys[e[i].id][1].push_back({b, w + e[i].v});
		dfs2(e[i].to, a, b, w + e[i].v, x);
	}
}
void solve(int x, int d) {
	x = getroot(x);
	vis[x] = 1;

	ops[x].push_back({node + x, 0});
	for(int i = h[x];i;i = e[i].nxt) if(!vis[e[i].to]) {

		qys[e[i].id][0].push_back({node + x, e[i].v});
		qys[e[i].id][1].push_back({edge + e[i].id, e[i].v});

		qys[e[i].id][0].push_back({edge + e[i].id, 0});

		dfs2(e[i].to, node + x, edge + e[i].id, e[i].v, x);
	}

	for(int i = h[x];i;i = e[i].nxt) if(!vis[e[i].to]) {
		solve(e[i].to, d + 1);
	}
}
int main() {
#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	for(int i = 1, x, y, v;i < n;++i) {
		cin >> x >> y >> v, link(x, y, v, i);
	}
	solve(1, 0);
	cin >> q;
	for(int i = 1;i <= q;++i) {
		char c; int x; ll w;
		cin >> c;
		if(c == '+') {
			cin >> x >> w;
			for(auto [ds, d] : ops[x]) {
				ds -> ins(w - d);
			}
		} else {
			cin >> x;
			int cnt = 0;
			for(auto [ds, d] : qys[x][0]) {
				cnt += ds -> leq(d);
			}
			for(auto [ds, d] : qys[x][1]) {
				cnt -= ds -> leq(d);
			}
			cout << cnt << '\n';
		}
	}
}