#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
#define F first
#define S second
#define All(x) (x).begin(), (x).end()
#define len(x) (int) (x).size()
#define pb push_back

const int N = 2e5 + 7, P = 1e9 + 7;
int n, st[N], sz[N], h[N], hld[N], big[N], cnt_lca[N], spar[N];
int sum[N << 2], lazy[N << 2], Cnt[N << 2];
vector<int> adj[N];

int power(int a, int b) {
	if (!b)
		return 1;
	int tmp = power(a, b / 2);
	return b % 2? 1LL * tmp * tmp % P * a % P: 1LL * tmp * tmp % P;
}

void add(int l, int r, int x, int id = 1, int st = 0, int en = n) {
	if (r <= st || l >= en)
		return;
	if (st >= l && en <= r) {
		Cnt[id] += x;
		return;
	}
	int mid = (st + en) >> 1;
	add(l, r, x, id << 1, st, mid);
	add(l, r, x, id << 1 | 1, mid, en);
}

int get_cnt(int p, int id = 1, int st = 0, int en = n) {
	if (en - st == 1)
		return Cnt[id];
	int mid = (st + en) >> 1;
	return Cnt[id] + (p < mid? get_cnt(p, id << 1, st, mid): get_cnt(p, id << 1 | 1, mid, en));
}

void Apply(int id, int x) {
	sum[id] = 1LL * sum[id] * x % P;
	lazy[id] = 1LL * lazy[id] * x % P;
}

void shift(int id) {
	Apply(id << 1, lazy[id]);
	Apply(id << 1 | 1, lazy[id]);
	lazy[id] = 1;
}

void mul(int l, int r, int x, int id = 1, int st = 0, int en = n) {
	if (r <= st || l >= en)
		return;
	if (st >= l && en <= r) {
		Apply(id, x);
		return;
	}
	shift(id);
	int mid = (st + en) >> 1;
	mul(l, r, x, id << 1, st, mid), mul(l, r, x, id << 1 | 1, mid, en);
	sum[id] = (sum[id << 1] + sum[id << 1 | 1]);
}

void Set(int p, int x, int id = 1, int st = 0, int en = n) {
	if (en - st == 1) {
		sum[id] = x;
		return;
	}
	int mid = (st + en) >> 1;
	shift(id);
	p < mid? Set(p, x, id << 1, st, mid): Set(p, x, id << 1 | 1, mid, en);
	sum[id] = (sum[id << 1] + sum[id << 1 | 1]) % P;
}

void dfs_sz(int u) {
	sz[u] = 1, big[u] = n;
	for (int v: adj[u])
		if (v != spar[u]) {
			spar[v] = u;
			h[v] = 1 + h[u];
			dfs_sz(v);
			if (sz[v] > sz[big[u]])
				big[u] = v;
			sz[u] += sz[v];
		}
	if (big[u] == n)
		big[u] = -1;
}

void dfs(int u) {
	static int t = 0;
	st[u] = t++;
	if (~big[u]) {
		hld[big[u]] = hld[u];
		dfs(big[u]);
	}
	for (int v: adj[u])
		if (v != spar[u] && v != big[u]) {
			hld[v] = v;
			dfs(v);
		}
}

void upd(int u, int v, int x) {
	int W = (x == 1? 2: power(2, P - 2));
	while (hld[u] != hld[v]) {
		if (h[hld[u]] < h[hld[v]])
			swap(u, v);
		add(st[hld[u]], st[u] + 1, x);
		mul(st[hld[u]], st[u] + 1, W);
		u = spar[hld[u]];
	}
	if (h[u] < h[v])
		swap(u, v);
	add(st[v], st[u] + 1, x), mul(st[v], st[u] + 1, W);
	add(st[v], st[v] + 1, -x);
	cnt_lca[v] += x;
	int X = cnt_lca[v], Y = get_cnt(st[v]);
	Set(st[v], 1LL * (power(2, X) - 1 + P) % P * power(2, Y) % P);
}

int32_t main() {
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	dfs_sz(0);
	dfs(0);
	int q;
	cin >> q;
	while (q--) {
		char c;
		int u, v;
		cin >> c >> u >> v;
		u--, v--;
		if (c == '+')
			upd(u, v, 1);
		else
			upd(u, v, -1);
		cout << sum[1] << '\n';
	}
	return 0;
}