做出来答案不对啊QAQ

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
const int maxn=200000+5;
vector<int> G[maxn];
int w[maxn];
int main(){
//freopen("link.in","r",stdin);
//freopen("link.out","w",stdout);
int n,u,v,sumans=0,maxans=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
}
for(int i=1;i<=n;i++) scanf("%d",&w[i]);
for(int i=1;i<=n;i++){
if(G[i].size()>=2){
int big1=0,big2=0,sum=0;
for(int j=0;j<G[i].size();j++){
int x=G[i][j];
if(w[x]>big1){
big2=big1;
big1=w[x];
}
else if(w[x]>big2) big2=w[x];
sum=(sum+w[x])%10007;
}
maxans=max(maxans,big1*big2);
for(int j=0;j<G[i].size();j++) sumans=(sumans+w[G[i][j]]*(sum-w[G[i][j]]))%10007;
}
}
printf("%d %d\n",maxans,sumans);
return 0;
}