/*
    长弓背负，仙女月鹫，
	梦中徐来，长夜悠悠。
	今宵共君，夜赏囃子，
	盼君速归，长夜悠悠。
	睡意袭我，眼阖梦徭，
	睡意袭我，意归襁褓。
	手扶卓揭，仙女水狃，
	盼君速归，长夜悠悠。
	今宵共君，戏于西楼，
	盼君速归，长夜悠悠。
	睡意袭我，涟锜池留，
	睡意袭我，意归海角。
					                  ——《ever17》
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 2e5 + 9, mod = 1e9 + 7;
int to[N], head[N], nxt[N], cnt, n, m, rt;
int val[N], a[N];
int siz[N], son[N], top[N], dep[N];
int dfn[N], fa[N], tim;
inline void addedge(int u, int v)
{
	to[++cnt] = v; nxt[cnt] = head[u], head[u] = cnt;
}
inline void dfs1(int u, int f)
{
	fa[u] = f; dep[u] = dep[f] + 1; siz[u] = 1;
	for (int i = head[u]; i; i = nxt[i])
		if(to[i] != f)
		{
			dfs1(to[i], u);
			if(siz[son[u]] < siz[to[i]]) son[u] = to[i];
			siz[u] += siz[to[i]];
		}
}
inline void dfs2(int u, int topf)
{
	dfn[u] = ++tim;
	top[u] = topf;
	if(son[u]) dfs2(son[u], topf);
	for (int i = head[u]; i; i = nxt[i])
		if(to[i] != son[u] && to[i] != fa[u]) dfs2(to[i], to[i]);
}
int tr[N << 2], tag[N << 2], inv2 = (mod + 1) / 2;
inline int lc(int p) {return p << 1;}
inline int rc(int p) {return p << 1 | 1;}
inline void push_up(int p) {tr[p] = (tr[lc(p)] + tr[rc(p)]) % mod; return ;}
inline void push_down(int p)
{
	if(tag[p] != 1)
	{
		tag[lc(p)] = tag[lc(p)] * tag[p] % mod;
		tag[rc(p)] = tag[rc(p)] * tag[p] % mod;
		tr[lc(p)] = tr[lc(p)] * tag[p] % mod;
		tr[rc(p)] = tr[rc(p)] * tag[p] % mod; tag[p] = 1; return ;
	} return ;
}
inline void build(int l, int r, int p)
{
	tag[p] = 1;
	if(l == r) {tr[p] = tag[p] = 1; return ;}
	int mid = (l + r) >> 1;
	build(l, mid, lc(p)); build(mid + 1, r, rc(p));
	push_up(p); return ;
}
inline void update(int l, int r, int p, int L, int R, int v)
{
	if(L > R) return ;
	if(L <= l && r <= R) {tr[p] = tr[p] * v % mod, tag[p] = tag[p] * v % mod;return ;}
	int mid = (l + r) >> 1;
	push_down(p);
	if(mid >= L) update(l, mid, lc(p), L, R, v);
	if(mid < R) update(mid + 1, r, rc(p), L, R, v);
	push_up(p); return ;
}
inline int update_chain(int x, int y, int v)
{
	while(top[x] != top[y])
	{
		if(dep[top[x]] < dep[top[y]]) swap(x, y);
		update(1, n, 1, dfn[top[x]], dfn[x], v);
		x = fa[top[x]];
	}
	if(dep[x] > dep[y]) swap(x, y);
	update(1, n, 1, dfn[x], dfn[y], v);
	return x;
}
int ans[N];
char opt[8];
struct node
{
	int op, u, v;
}p[N];
signed main()
{
	n = read();
	for (int i = 1; i < n; i++)
	{
		int x = read(), y = read();
		addedge(x, y); addedge(y, x);
	}
	int q = read();
 	dfs1(1, 0); dfs2(1, 1);
 	build(1, n, 1);
 	L(i, 1, q)
 	{
 		scanf("%s", opt + 1);
 		int u = read(), v = read();
 		if(opt[1] == '+') p[i] = node{1, u, v}, update_chain(u, v, 2);
 		else p[i] = node{2, u, v}, update_chain(u, v, inv2);
 		ans[i] = tr[1];
	}
	build(1, n, 1);
	L(i, 1, q)
	{
		int t, u = p[i].u, v = p[i].v;
		if(p[i].op == 1)
		{
			t = update_chain(u, v, 2); update(1, n, 1, dfn[t], dfn[t], inv2);
		}
		else
		{
			t = update_chain(u, v, inv2); update(1, n, 1, dfn[t], dfn[t], 2);
		}
		ans[i] = (ans[i] - tr[1] + mod) % mod;
	}
	L(i, 1, q) printf("%lld\n", ans[i] % mod);
	return 0;
}