#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a,i##end=b; i<=i##end; i++)
#define drep(i,a,b) for(int i=a,i##end=b; i>=i##end; i--)
#define repp(i,a,b) for(int i=a,i##end=b; i<i##end; i++)
#define drepp(i,a,b) for(int i=a,i##end=b; i>i##end; i--)
#define Erep(i,x) for(int i=head[x]; i; i=Edge[i].nxt)
#define Srep(i,x) for(int i=x,i##end=x; i; i=(i-1)&i##end)
#define debug(x) cerr<<#x<<" = "<<x<<endl
#define fi first
#define se second
#define PII pair<int,int>
#define coint const int
#define ms(x,a) memset(x,a,sizeof x)
#define CM cerr<<(&S2-&S1)/1024.<<"KB"<<endl
//std::mt19937_64 Rnd {std::chrono::steady_clock::now().time_since_epoch().count()};
// Rnd();
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
template<class T>inline T lowbit(const T &x) { return x&-x; }

coint N=2e5+5;
coint mod=1e9+7,inv2=500000004;

int n;
ll fpow[N],inv[N];
vector<int>Edge[N];
int tp[N],f[N],sz[N],son[N],dep[N];
int L[N],R[N],dfn[N],tot;

void Init(){
	fpow[0]=1;
	inv[0]=1;
	rep(i,1,N-5){
		fpow[i]=fpow[i-1]*2%mod;
		inv[i]=inv[i-1]*inv2%mod;
	}
}

void dfs(int x, int fa){
	sz[x]=1; f[x]=fa; dep[x]=dep[fa]+1;
	int &SON=son[x];
	SON=-1;
	for(int y:Edge[x]){
		if(y==fa) continue;
		dfs(y,x);
		sz[x]+=sz[y];
		if(SON==-1 || sz[SON]<sz[y]) SON=y;
	}
}

void dfs_top(int x, int fa, int top){
	L[x]=++tot; dfn[tot]=x;
	tp[x]=top;
	coint &SON=son[x];
	if(SON!=-1) dfs_top(SON,x,top);
	for(int y:Edge[x]){
		if(y!=fa && y!=SON) dfs_top(y,x,y);
	}
	R[x]=tot;
}

ll check(int x){
	return x>=0?fpow[x]:inv[-x];
}

struct Segment_Tree{
	ll sum[N<<1];
	int lazy[N<<1];
	void Up(coint &p){
		coint ls=p<<1,rs=ls|1;
		sum[p]=(sum[ls]+sum[rs])%mod;
	}
	void Down(coint &p){
		if(!lazy[p]) return;
		coint ls=p<<1,rs=ls|1,res=lazy[p];
		sum[ls]=sum[ls]*check(res)%mod; lazy[ls]+=res;
		sum[rs]=sum[rs]*check(res)%mod; lazy[rs]+=res;
		lazy[p]=0; return;
	}
	void Build(coint &p, coint &l, coint &r){
		lazy[p]=0;
		if(l==r){
			sum[p]=1;
			return;
		}
		coint mid=(l+r)>>1,ls=p<<1,rs=ls|1;
		Build(ls,l,mid); Build(rs,mid+1,r);
		Up(p);
	}
	void Upd(coint &p, coint &l, coint &r, coint &L, coint &R, coint &val){
		if(l==L && r==R){
			sum[p]*=check(val); sum[p]%=mod;
			lazy[p]+=val;
			return;
		}
		Down(p);
		coint mid=(l+r)>>1,ls=p<<1,rs=ls|1;
		if(R<=mid) Upd(ls,l,mid,L,R,val);
		else if(L>mid) Upd(rs,mid+1,r,L,R,val);
		else Upd(ls,l,mid,L,mid,val),Upd(rs,mid+1,r,mid+1,R,val);
		Up(p); return;
	}
}sgtr1,sgtr2;

void Add(int x, int y, int val){
	int tpx=tp[x],tpy=tp[y];
	while(tpx!=tpy){
		if(dep[tpx]<dep[tpy]){
//			cout<<"Add "<<y<<" -> "<<tpy<<"\n";
			sgtr1.Upd(1,1,n,L[tpy],L[y],val);
			sgtr2.Upd(1,1,n,L[tpy],L[y],val);
			y=f[tpy];
			tpy=tp[y];
		}else{
//			cout<<"Add "<<x<<" -> "<<tpx<<"\n";
			sgtr1.Upd(1,1,n,L[tpx],L[x],val);
			sgtr2.Upd(1,1,n,L[tpx],L[x],val);
			x=f[tpx];
			tpx=tp[x];
		}
	}
	if(dep[x]>dep[y]) swap(x,y);
//	cout<<"Add "<<y<<" -> "<<x<<"\n";
	sgtr1.Upd(1,1,n,L[x],L[y],val);
	if(x!=y) sgtr2.Upd(1,1,n,L[x]+1,L[y],val);
}

void solve(){
	Init();
	cin>>n;
	rep(i,2,n){
		int x,y;
		cin>>x>>y;
		Edge[x].push_back(y);
		Edge[y].push_back(x);
	}
	dfs(1,0); dfs_top(1,0,1);
	sgtr1.Build(1,1,n); sgtr2.Build(1,1,n);
	int q;
	cin>>q;
	while(q--){
		string opt;
		int a,b;
		cin>>opt>>a>>b;
		Add(a,b,opt=="+"?1:-1);
		cout<<(sgtr1.sum[1]-sgtr2.sum[1]+mod)%mod<<"\n";
	}
	return;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	int T=1;
//	cin>>T;
	while(T--) solve();
	return 0;
}
/*

input:

5
1 2
5 1
2 3
4 2
6
+ 4 5
+ 2 2
+ 1 3
- 2 2
+ 2 3
+ 4 4

output:

1
3
7
3
7
9

*/