1
#include<bits/stdc++.h>
2
#define int long long
3
using namespace std;
4

5
const int N = 2e5 + 10;
6
int W[N];
7
int n;
8
int cnt = 1;
9
int head[N], nxt[N << 1], to[N << 1];
10
int maxx = 0, sum = 0;
11
void add(int x, int y)
12
{
13
  to[++cnt] = y;
14
  nxt[cnt] = head[x];
15
  head[x] = cnt;
16
}
17

18
void dfs(int u, int fa)
19
{
20
  int son_max1 = 0, son_max2 = 0;
21
  int son_sum = 0;
22
  for(int i = head[u];i ;i = nxt[i])
23
  {
24
    int v = to[i];
25
    if(v == fa) continue;
26
    dfs(v, u);
27
    son_sum += W[v];
28
    if(W[v] > son_max1)
29
    {
30
      son_max2 = son_max1;
31
      son_max1 = W[v];
32
    }
33
    else if(W[v] > son_max2)
34
    {
35
      son_max2 = W[v];
36
    }
37
  }
38
  maxx = max(son_max1 * son_max2, maxx);
39
  maxx = max(maxx, W[fa] * son_max1);
40
//  cout << u <<"------" <<endl;
41
//  cout << son_sum << endl;
42
  for(int i = head[u]; i ; i = nxt[i])
43
  {
44
    if(to[i] == fa) continue;
45
    int v = to[i];
46
    sum = (sum + (son_sum - W[v]) * W[v]) % 10007;
47
  }
48
  sum = (sum + 2 * W[fa] * son_sum) % 10007;
49
//  cout << sum << endl;
50
}
51

52

53
signed main()
54
{
55
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
56
  cin >> n;
57
  for(int i = 1, u, v;i <= n - 1;i++)
58
  {
59
    cin >> u >> v;
60
    add(u, v);
61
    add(v, u);
62
  }
63

64
  for(int i = 1;i <= n;i++)
65
    cin >> W[i];
66

67
  dfs(1, 0);
68
  cout << maxx << " " << sum;
69
  return 0;
70
}