#include<bits/stdc++.h>
using std::cin, std::cout;
const int mod = 1e9 + 7;
const int N = 200005;
const int inv2 = (mod + 1) / 2;
using u64 = unsigned long long;
int n;
struct sgt {
	int sum[N << 2];
	int tag[N << 2];
	void update(int x) {
		sum[x] = (sum[x << 1] + sum[x << 1 | 1]) % mod;
	}
	void put(int x, int v) {
		sum[x] = (u64) sum[x] * v % mod;
		tag[x] = (u64) tag[x] * v % mod;
	}
	void down(int x) {
		put(x << 1, tag[x]);
		put(x << 1 | 1, tag[x]);
		tag[x] = 1;
	}
	void build(int cur, int l, int r) {
		tag[cur] = 1;
		if(l == r) {
			sum[cur] = 1;
			return ;
		}
		int mid = (l + r) >> 1;
		build(cur << 1, l, mid);
		build(cur << 1 | 1, mid + 1, r);
		update(cur);
	}
	void apply(int ql, int qr, int v, int cur = 1, int l = 1, int r = n) {
		if(ql <= l && r <= qr) {
			return put(cur, v);
		}
		int mid = (l + r) >> 1;
		down(cur);
		if(ql <= mid) apply(ql, qr, v, cur << 1, l, mid);
		if(mid < qr) apply(ql, qr, v, cur << 1 | 1, mid + 1, r);
		update(cur);
	}
} A, B;
std::vector<int> go[N];
int dfn[N], size[N], top[N], son[N], cnt;
int anc[N];
void dfs1(int x, int t, int fa = 0) {
	anc[x] = fa;
	dfn[x] = ++ cnt; top[x] = t;
	if(son[x]) dfs1(son[x], t, x);
	for(int i : go[x]) if(i != fa && i != son[x]) {
		dfs1(i, i, x);
	}
}
void dfs0(int x, int fa = 0) {
	size[x] = 1;
	for(int i : go[x]) if(i != fa) {
		dfs0(i, x);
		if(size[i] > size[son[x]]) {
			son[x] = i;
		}
	}
}
void solve(int u, int v, int w) {
	for(;top[u] != top[v];) {
		if(dfn[u] < dfn[v]) {
			std::swap(u, v);
		}
		A.apply(dfn[top[u]], dfn[u], w);
		B.apply(dfn[top[u]], dfn[u], w);
		u = anc[top[u]];
	}
	if(dfn[u] > dfn[v]) {
		std::swap(u, v);
	}
	A.apply(dfn[u], dfn[v], w);
	if(u != v)
		B.apply(dfn[u] + 1, dfn[v], w);
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	for(int i = 1, a, b;i < n;++i) {
		cin >> a >> b;
		go[a].push_back(b);
		go[b].push_back(a);
	}
	A.build(1, 1, n);
	B.build(1, 1, n);
	dfs0(1);

	dfs1(1, 1);
	int q; cin >> q;
	for(int i = 1;i <= q;++i) {
		char c; int u, v;
		cin >> c >> u >> v;
		solve(u, v, c == '+' ? 2 : inv2);
		int ans = (A.sum[1] - B.sum[1] + mod) % mod;
		cout << ans << '\n';
	}
}