#include <cstdio>
#include <vector>
#include <algorithm>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;

const int N = 2e5 + 500;
const int LOG = 18;
const int MOD = 1e9 + 7;
const int OFF = 1 << 18;

inline int add(int A, int B) {
	if(A + B >= MOD) return A + B - MOD;
	return A + B;
}

inline int sub(int A, int B) {
	if(A - B < 0) return A - B + MOD;
	return A - B;
}

inline int mul(int A, int B) {
	return (ll)A * B % MOD;
}

inline int pot(int A, int B) {
	int ret = 1, bs = A;
	for(; B ; B >>= 1) {
		if(B & 1) ret = mul(ret, bs);
		bs = mul(bs, bs);
	}
	return ret;
}

int ind[N], siz[N], par[N][LOG], hat[N], dep[N], pot2[N], kof[2 * OFF];
vector < int > v[N];
int tme;

int prop[2 * OFF], T[2 * OFF], imp[N], n;

void refresh(int x) {
	if(prop[x] == 1) return;
	T[x] = mul(T[x], prop[x]);
	if(x < OFF) {
		prop[2 * x] = mul(prop[2 * x], prop[x]);
		prop[2 * x + 1] = mul(prop[2 * x + 1], prop[x]);
	}
	prop[x] = 1;
}

void range_update(int i, int a, int b, int lo, int hi, int x) {
	if(lo <= a && b <= hi) {
		prop[i] = mul(prop[i], x); refresh(i); return;
	}
	if(a > hi || b < lo) return;
	range_update(2 * i, a, (a + b) / 2, lo, hi, x);
	range_update(2 * i + 1, (a + b) / 2 + 1, b, lo, hi, x);
	if(2 * i < OFF) T[i] = add(T[2 * i], T[2 * i + 1]);
	else T[i] = add(mul(T[2 * i], kof[2 * i]), mul(T[2 * i + 1], kof[2 * i + 1]));
}


void precompute(){
	pot2[0] = 1;
	for(int i = 1;i < N;i++)
		pot2[i] = add(pot2[i - 1], pot2[i - 1]);
}

bool cmp(int x, int y) {
	return siz[x] > siz[y];
}

void dfs_siz(int x, int lst){
	siz[x] = 1; par[x][0] = lst;
	dep[x] = dep[lst] + 1;
	for(int y : v[x]) {
		if(y == lst) continue;
		dfs_siz(y, x);
		siz[x] += siz[y];
	}
}

void dfs(int x, int lst, int cur) {
	ind[x] = tme++; hat[x] = cur;
	int fir = 1;
	sort(v[x].begin(), v[x].end(), cmp);
	for(int y : v[x]) {
		if(y == lst) continue;
		dfs(y, x, fir ? cur : y);
		fir = 0;
	}
}

int digni(int x, int k) {
	for(int i = 0;i < LOG;i++)
		if(k & (1 << i)) x = par[x][i];
	return x;
}

int lca(int a, int b) {
	if(dep[a] < dep[b]) swap(a, b);
	a = digni(a, dep[a] - dep[b]);
	if(a == b) return a;
	for(int k = LOG - 1;k >= 0;k--)
		if(par[a][k] != par[b][k])
			a = par[a][k], b = par[b][k];
	return par[a][0];
}

void hld_path(int a, int b, int x) {
	while(dep[hat[a]] > dep[b]) {
		range_update(1, 0, OFF - 1, ind[hat[a]], ind[a], x);
		a = par[hat[a]][0];
	}
	range_update(1, 0, OFF - 1, ind[b], ind[a], x);
}

void add_path(int a, int b, int fl) {
	if(dep[a] < dep[b]) swap(a, b);
	int lc = lca(a, b);
	imp[lc] += fl ? 1 : -1; 
	kof[OFF + ind[lc]] = pot2[imp[lc]] - 1;
	range_update(1, 0, OFF - 1, ind[lc], ind[lc], 1);
	int fact = fl ? 2 : ((MOD + 1) / 2);
	if(a != b) {
		hld_path(a, digni(a, dep[a] - dep[lc] - 1), fact);
		if(b != lc) hld_path(b, digni(b, dep[b] - dep[lc] - 1), fact);
	} 
}



int main() {
	precompute();
	scanf("%d", &n);
	for(int i = 1;i < n;i++) {
		int x, y; scanf("%d%d", &x, &y);
		v[x].PB(y), v[y].PB(x);
	}
	dfs_siz(1, 1); dfs(1, 1, 1);
	for(int j = 1;j < LOG;j++)
		for(int i = 1;i <= n;i++)
			par[i][j] = par[par[i][j - 1]][j - 1];
	for(int i = 0;i < n;i++) T[OFF + i] = 1, prop[OFF + i] = 1;
	for(int i = OFF - 1; i ; i--) {
		prop[i] = 1;
	}
	int q; scanf("%d", &q);
	for(;q--;) {
		char ty; int a, b; scanf(" %c%d%d", &ty, &a, &b);
		add_path(a, b, ty == '+');
		printf("%d\n", T[1]);		
	}
	return 0;
}