WA on第二个样例

105
108
106
109
106
100

#include<bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<pair<int,int>>> g;
pair<int,int> dfs(int x,int y){
    int id=x,ans=0;
    pair<int,int> z;
    for(auto p:g[x]){
        if(p.second==y) continue;
        z=dfs(p.second,x);
        if(z.first+p.first>ans){
            id=z.second;
            ans=z.first+p.first;
        }
    }
    return {ans,id};
}
void ans(int x,int y,int z,vector<int> &dp){
    dp[x]=z;
    for(auto i:g[x]){
        if(i.second==y) continue;
        ans(i.second,x,z+i.first,dp);
    }
}
signed main(){
    int n,a,b,c,d;
    cin>>n;
    g.resize(2*n+1);
    for(int i=1;i<n;++i){
        cin>>a>>b>>c;
        g[a].push_back({c,b});
        g[b].push_back({c,a});
    }
    for(int i=1;i<=n;++i){
        cin>>d;
        g[i].push_back({d,n+i});
        g[n+i].push_back({d,i});
    }
    a=dfs(1,0).second;
    b=dfs(a,0).second;
    vector<int> dpa(2*n+1);
    vector<int> dpb(2*n+1);
    ans(a,0,0,dpa);
    ans(b,0,0,dpb);
    for(int i=1;i<=n;++i){
        cout<<max(dpa[i],dpb[i])<<'\n';
    }
    return 0;
}