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

#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);

#define lid (id*2)
#define rid (id*2+1)
#define mid ((l+r)/2)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 2e5 + 50;
const ll Mod = 1e9 + 7;

ll n, q, par[N], sz[N], head[N], st[N], timer = 1, p2[N];

vector<int> adj[N];

ll mod(ll a, ll b = Mod){
    while(a >= b) a -= b;
    return a;
}

void pre(int v){
    if(par[v]) adj[v].erase(find(all(adj[v]), par[v]));
    sz[v] = 1;
    for(int u: adj[v]){
        par[u] = v; pre(u); sz[v] += sz[u];
    }
    for(int i = 1; i < adj[v].size(); i++) if(sz[adj[v][0]] < sz[adj[v][i]]) swap(adj[v][0], adj[v][i]);
}

void hld(int v){
    st[v] = timer++;
    for(int u: adj[v]){
        if(u == adj[v][0]) head[u] = head[v];
        else head[u] = u;
        hld(u);
    }
}

int bit1[N], bit2[N];

void upd1(int x, int y){
    for(; x <= n; x += x & (-x)) bit1[x] += y;
}

int get1(int x){
    int out = 0;
    for(; x; x &= x-1) out += bit1[x];
    return out;
}

void upd2(int x, int y){
    for(; x <= n; x += x & (-x)) bit2[x] += y;
}

int get2(int x){
    int out = 0;
    for(; x; x &= x-1) out += bit2[x];
    return out;
}

void upd_path1(int u, int v, int x){
    while(head[u] != head[v]){
        if(st[u] < st[v]) swap(u, v);
        upd1(st[head[u]], x); upd1(st[u]+1, -x);
        u = par[head[u]];
    }
    if(st[u] < st[v]) swap(u, v);
    upd1(st[v], x); upd1(st[u]+1, -x);
}

void upd_path2(int u, int v, int x){
    while(head[u] != head[v]){
        if(st[u] < st[v]) swap(u, v);
        upd2(st[head[u]], x); upd2(st[u]+1, -x);
        u = par[head[u]];
    }
    if(st[u] < st[v]) swap(u, v);
    upd2(st[v]+1, x); upd2(st[u]+1, -x);
}

int main(){
    fast_io;

    p2[0] = 1;
    for(int i = 1; i < N; i++) p2[i] = mod(p2[i-1] + p2[i-1]);

    cin >> n;

    int u, v;
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    pre(1); head[1] = 1; hld(1);

    cin >> q;

    while(q--){
        char t;
        cin >> t >> u >> v;

        if(t == '+'){
            upd_path1(u, v, 1); upd_path2(u, v, 1);
        }
        else{
            upd_path1(u, v, -1); upd_path2(u, v, -1);
        }

        ll res = 0;
        for(int i = 1; i <= n; i++) res = mod(res + p2[get1(i)] - p2[get2(i)] + Mod);

        cout << res << endl;
    }

}