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

const int MAXN = 200000+5;
const ll mod = 1e9+7;
int n, q, tot;
ll inv2, pw[MAXN], ipw[MAXN];
ll sum[MAXN<<2], tag[MAXN<<2], len[MAXN<<2];
int fa[MAXN], sz[MAXN], dep[MAXN], hson[MAXN];
int top[MAXN], dfn[MAXN], rnk[MAXN];
vector<int> G[MAXN];

ll fpow(ll a, ll p, ll mod){
	ll res = 1;
	while(p){
		if(p&1)  res = res*a%mod;
		a = a*a%mod;
		p >>= 1;
	}
	return res;
}

void dfs1(int u, int f){
	dep[u] = dep[f]+1;
	fa[u] = f;
	sz[u] = 1;
	for(int v : G[u]){
		if(v == f)  continue;
		dfs1(v, u);
		sz[u] += sz[v];
		if(sz[v] > sz[hson[u]])
			hson[u] = v;
	}
}

void dfs2(int u, int tp){
	top[u] = tp;
	dfn[u] = ++tot;
	rnk[tot] = u;
	if(!hson[u])  return;
	dfs2(hson[u], tp);
	for(int v : G[u]){
		if(v == fa[u] || v == hson[u])  continue;
		dfs2(v, v);
	}
}

void build(int x, int l, int r){
	len[x] = r-l+1;
	if(l == r){
		return;
	}
}

void pushup(int x){
	sum[x] = (sum[x<<1]+sum[x<<1|1])%mod;
}

void pushdown(int x){
	int ls = x<<1, rs = x<<1|1;
	if(tag[x] > 0){
		sum[ls] = sum[ls]*pw[tag[x]]%mod;
		sum[rs] = sum[rs]*pw[tag[x]]%mod;
		tag[ls] += tag[x];
		tag[rs] += tag[x];
		tag[x] = 0;
	}
	else if(tag[x] < 0){
		sum[ls] = sum[ls]*ipw[-tag[x]]%mod;
		sum[rs] = sum[rs]*ipw[-tag[x]]%mod;
		tag[ls] += tag[x];
		tag[rs] += tag[x];
		tag[x] = 0;
	}
}

void add(int x, int l, int r, int L, int R, int v){
	// cout << "add " << x << " " << l << " " << r << " " << L << " " << R << " " << v << "\n";
	if(L <= l && r <= R){
		if(v > 0){
			sum[x] = sum[x]*2%mod;
			tag[x]++;
		}
		else{
			sum[x] = sum[x]*inv2%mod;
			tag[x]--;
		}
		return;
	}
	pushdown(x);
	int mid = (l+r)>>1;
	if(L <= mid)  add(x<<1, l, mid, L, R, v);
	if(R > mid)  add(x<<1|1, mid+1, r, L, R, v);
	pushup(x);
}

void update(int x, int l, int r, int c, int v){
	if(l == r){
		// cout << "l = " << l << " tag = " << tag[x] << "\n";
		if(v > 0){
			tag[x]--;
			sum[x] = (sum[x] + pw[tag[x]]) % mod;
		}
		else{
			sum[x] = (sum[x] - pw[tag[x]] + mod) % mod;
			tag[x]++;
		}
		return;
	}
	pushdown(x);
	int mid = (l+r)>>1;
	if(c <= mid)  update(x<<1, l, mid, c, v);
	else  update(x<<1|1, mid+1, r, c, v);
	pushup(x);
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	pw[0] = 1;
	ipw[0] = 1;
	inv2 = fpow(2, mod-2, mod);
	for(int i = 1; i <= 50000; i++){
		pw[i] = pw[i-1]*2%mod;
		ipw[i] = ipw[i-1]*inv2%mod;
	}
	cin >> n;
	for(int i = 1; i < n; i++){
		int u, v;
		cin >> u >> v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	dfs1(1, 0);
	dfs2(1, 1);
	build(1, 1, n);
	cin >> q;
	while(q--){
		string op;
		int u, v;
		cin >> op >> u >> v;
		if(op == "+"){
			while(top[u] != top[v]){
				if(dep[top[u]] < dep[top[v]])
					swap(u, v);
				add(1, 1, n, dfn[top[u]], dfn[u], 1);
				u = fa[top[u]];
			}
			if(dep[u] > dep[v])  swap(u, v);
			// cout << "sum " << sum[1] << "\n";
			// cout << "lca = " << u << "\n";
			add(1, 1, n, dfn[u], dfn[v], 1);
			update(1, 1, n, dfn[u], 1);
		}
		else{
			while(top[u] != top[v]){
				if(dep[top[u]] < dep[top[v]])
					swap(u, v);
				add(1, 1, n, dfn[top[u]], dfn[u], -1);
				u = fa[top[u]];
			}
			if(dep[u] > dep[v])  swap(u, v);
			// cout << "sum " << sum[1] << "\n";
			// cout << "lca = " << u << "\n";
			add(1, 1, n, dfn[u], dfn[v], -1);
			update(1, 1, n, dfn[u], -1);
		}
		cout << sum[1] << "\n";
	}
	return 0;
}