E.cpp

//#pragma GCC optimize "trapv"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define vll vector<ll>
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll add(ll x, ll y) {ll res = x + y; return (res >= MOD ? res - MOD : res);}
ll mul(ll x, ll y) {ll res = x * y; return (res >= MOD ? res % MOD : res);}
ll sub(ll x, ll y) {ll res = x - y; return (res < 0 ? res + MOD : res);}
ll power(ll x, ll y) {ll res = 1; x %= MOD; while (y) {if (y & 1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
ll mod_inv(ll x) {return power(x, MOD - 2);}

using namespace std;
const int N = 2e5 + 4;
vector<int> v[N];
int in[N], out[N];
ll val[N], val2[N];
ll fin[N];
int tim = 0;
void dfs( int src, int par)
{
    in[src] = tim++;



    for ( auto i : v[src])
    {
        if (i ^ par)
        {
            dfs(i, src);
        }
    }

    out[src] = tim++;
}
bool isancestor(int u, int v)
{
    return (in[u] <= in[v] and out[u] >= out[v]);
}

void dfs2( int src, int par, ll tot)
{
    tot += val[src];
    fin[src] = tot;

    for (auto i : v[src])
    {
        if (i ^ par)
        {
            dfs2(i, src, tot + val2[src]);
        }
    }

}

int main()
{   quick;
#ifndef ONLINE_JUDGE
    freopen("D:/sublime/input.txt", "r", stdin);
    freopen("D:/sublime/output.txt", "w", stdout);
#endif
    int n;
    cin >> n;
    vector<pair<int, int> > ed(n);
    fab(1, n, i)
    {
        cin >> ed[i].f >> ed[i].se;
        v[ed[i].se].pb(ed[i].f);
        v[ed[i].f].pb(ed[i].se);
    }
    dfs(1, 1);

    int q;
    cin >> q;
    while (q--)
    {
        ll tp, e, x;
        cin >> tp >> e >> x;
        int a = ed[e].f, b = ed[e].se;

        if (tp == 2)
        {
            swap(a, b);
        }
        //cout << "a:" << a << " " << b << endl;

        if (isancestor(a, b))
        {
            //cout << "S" << endl;
            val[b] -= x;
            val[1] += x;

            // val2[a] += x;

        }
        else
        {
            val[a] += x;

        }
    }

    dfs2(1, 1, 0LL);
    fab(1, n + 1, i)
    {
        cout << fin[i] << endl;
    }




    cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
    return 0;
}