#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=2e5+5;
struct edge{
    int u,to,nxt;
}e[2*maxn];
int head[maxn],cnt;
int x,y;
void add(int x,int y){
    e[++cnt].to=y;
    e[cnt].u=x;
    e[cnt].nxt=head[x];
    head[x]=cnt;
}
int c[maxn],n,m,p,dep[maxn];
void dfs(int u,int fa){
    dep[u]=dep[fa]+1;
    for(int i=head[u];i;i=e[i].nxt){
        int v=e[i].to;
        if(v==fa)continue;
        dfs(v,u);
    }
}
void dfs2(int u,int fa,int res){
    res+=c[u];
    c[u]=res;
    for(int i=head[u];i;i=e[i].nxt){
        int v=e[i].to;
        if(v==fa)continue;
        dfs2(v,u,res);
    }
}
signed main(){
	cin>>n;
	for(int i=1;i<n;i++){
	    cin>>x>>y;
	    add(x,y);
	    add(y,x);
	}
	dfs(1,0);
	int q;
	cin>>q;
	for(int i=1;i<=q;i++){
	    int t;
	    cin>>t>>x>>y;
	    int u=e[2*x-1].u,v=e[2*x-1].to;
	    if(t==2){
	        swap(u,v);
	    }
	//    cerr<<u<<' '<<v<<endl;
	    if(dep[u]>dep[v]){
	        c[u]+=y;
	    }
	    else{
	        p+=y;
	        c[v]-=y;
	    }
	}
	dfs2(1,0,p);
	for(int i=1;i<=n;i++){
	    cout<<c[i]<<endl;
	}
}

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define CLZ(b) __builtin_clzll(b)
#define BITLEN(b) (64LL - CLZ(b))
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
ll llceil(ll a, ll b) { return (a + b - 1) / b; }
string toupper(const string& S) { string T(S); REP(i,SZ(T)) T[i] = toupper(T[i]); return T; }
string tolower(const string& S) { string T(S); REP(i,SZ(T)) T[i] = tolower(T[i]); return T; }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
static const double EPS = 1e-10;
static const double PI  = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
static const ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    ll N; cin >> N;
    VLL C(N); REP(i,N) cin >> C[i];
    VVLL G(N);
    REP(_,N-1) {
        ll A, B; cin >> A >> B;
        A--; B--;
        G[A].push_back(B);
        G[B].push_back(A);
    }

    ll L = 1e5;
    VLL cnt(L+1,0);
    VLL ans = {1};
    auto rec = [&](auto self, ll u, ll p) -> void {
        if (cnt[C[u]] == 0) ans.push_back(u+1);
        cnt[C[u]]++;
        for (ll v : G[u]) if (v != p) {
            self(self, v, u);
        }
        cnt[C[u]]--;
    };
    cnt[C[0]]++;
    for (ll v : G[0]) {
        rec(rec, v, 0);
    }
    SORT(ans);
    for (ll a : ans) COUT(a);

    return 0;
}
