1 #include<cstdio>
 2 #include<algorithm>
 3 #include<cstring>
 4 #define MAXN 200100
 5 #define mod 10007
 6 using namespace std;
 7 
 8 struct Edge{
 9     int to,nxt;
10 }e[MAXN<<1];
11 int head[MAXN],w[MAXN];
12 int tot,n,m,ans1,ans2,max1,max2,sum;
13 
14 int main()
15 {
16     scanf("%d",&n);
17     for (int u,v,i=1; i<n; ++i)
18     {
19         scanf("%d%d",&u,&v);
20         ++tot;
21         e[tot].to = v;
22         e[tot].nxt = head[u];
23         head[u] = tot;
24         ++tot;
25         e[tot].to = u;
26         e[tot].nxt = head[v];
27         head[v] = tot;        //建边 
28     }
29     for (int i=1; i<=n; ++i)
30         scanf("%d",&w[i]);
31     for (int i=1; i<=n; ++i)    //枚举中间点 
32     {
33         max1 = max2 = -1;
34         sum = 0;
35         for (int j=head[i]; j; j=e[j].nxt)
36         {
37             int v = w[e[j].to];
38             sum = (sum+v)%mod;
39             if (v>max1)        //max1最大，max2第二大
40             {
41                 max2 = max1;
42                 max1 = v;
43             }
44             else if (v>max2)
45                 max2 = v;
46         }
47         ans2 = max(ans2, max1*max2);    //记录最大值 
48         for (int j=head[i]; j; j=e[j].nxt)
49         {
50             ans1 += (w[e[j].to]*(sum-w[e[j].to]))%mod;    //记录和 
51             ans1 %= mod;
52         }
53     }
54     ans1 = (ans1+mod)%mod;
55     printf("%d %d\n", ans2, ans1);
56     return 0;
57 }