#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define N 214514
const ll mod = 1e9 + 7;
const ll inf = 1000000000000000000;
ll a[N], b[N];
ll par[N], num[N];
bool used[N];
int main() {
    ll n;
    cin >> n;
    vector<vector<ll>> v(n + 1);
    for (int i = 1; i < n; i++) {
        cin >> a[i] >> b[i];
        v[a[i]].push_back(b[i]);
        v[b[i]].push_back(a[i]);
    }
    par[1] = -1;
    used[1] = 1;
    queue<ll> que;
    que.push(1);
    while (!que.empty()) {
        ll x = que.front();
        que.pop();
        for (ll y : v[x]) {
            if (used[y]) continue;
            used[y] = 1;
            par[y] = x;
            que.push(y);
        }
    }
    ll q;
    cin >> q;
    while (q--) {
        ll t, e, x;
        cin >> t >> e >> x;
        if (t == 1) {
            if (par[a[e]] == b[e])
                num[a[e]] += x;
            else {
                num[1] += x;
                num[b[e]] -= x;
            }
        } else {
            if (par[b[e]] == a[e])
                num[b[e]] += x;
            else {
                num[1] += x;
                num[a[e]] -= x;
            }
        }
    }
    que.push(1);
    for (int i = 2; i <= n; i++) used[i] = 0;
    while (!que.empty()) {
        ll x = que.front();
        que.pop();
        for (ll y : v[x]) {
            if (used[y]) continue;
            used[y] = 1;
            num[y] += num[par[y]];
            que.push(y);
        }
    }
    for (int i = 1; i <= n; i++) cout << num[i] << endl;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

struct edge{int to, cost, id;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;
    vec par, val;
    int offset = 0;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
        par = vec(N, -1);
        val = vec(N, 0);
    }

    void add_Directed_edge(int from, int to, int cost = 1, int id = 0){
        G[from].push_back(edge({to, cost, id}));
    }

    void add_Undirected_edge(int v1, int v2, int cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    void dfs1(int v, int p = -1){
        par[v] = p;
        for(auto e: G[v]) if(e.to != p) dfs1(e.to, v);
    }

    void dfs2(int v, int p = -1){
        for(auto e: G[v]) if(e.to != p){
            val[e.to] += val[v];
            dfs2(e.to, v);
        }
        val[v] += offset;
    }

};

signed main(){

    int N; cin >> N;
    vec a(N - 1), b(N - 1);
    Graph G(N);
    REP(i, N - 1){
        cin >> a[i] >> b[i];
        a[i]--; b[i]--;
        G.add_Undirected_edge(a[i], b[i]);
    }
    G.dfs1(0);

    int Q; cin >> Q;
    REP(i, Q){
        int t, e, x; cin >> t >> e >> x;
        t--; e--;
        int u = a[e], v = b[e];

        if(G.par[v] != u){
            swap(u, v);
            t ^= 1;
        }

        if(t == 1) G.val[v] += x;
        else{
            G.offset += x;
            G.val[v] -= x;
        }
    }
    G.dfs2(0);
    Out(G.val);

    return 0;
}
