#include <cstdio>

 #include <cstring>

 #include <iostream>

 #define LL long long

 const int MAXN = , p = ;

 int n, cnt;

 int head[MAXN], to[MAXN << ], next[MAXN << ];

 LL max, tot, a[MAXN], sum[MAXN], ans[MAXN], max1[MAXN], max2[MAXN];

 bool vis[MAXN];

 inline int read()

 {

     int x = , f = ;

     char ch = getchar();

     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;

     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';

     return x * f;

 }

 inline LL Max(LL x, LL y)

 {

     return x > y ? x : y;

 }

 inline void add(int x, int y)

 {

     to[cnt] = y;

     next[cnt] = head[x];

     head[x] = cnt++;

 }

 inline void dfs(int u)

 {

     int i, v;

     vis[u] = ;

     for(i = head[u]; i ^ -; i = next[i])

     {

         v = to[i];

         ans[u] = (ans[u] + sum[u] * a[v]) % p;

         sum[u] = (sum[u] + a[v]) % p;

         if(a[v] > max1[u]) max2[u] = max1[u], max1[u] = a[v];

         else if(a[v] > max2[u]) max2[u] = a[v];

         if(!vis[v]) dfs(v);

     }

 }

 int main()

 {

     int i, x, y;

     n = read();

     memset(head, -, sizeof(head));

     for(i = ; i < n; i++)

     {

         x = read();

         y = read();

         add(x, y);

         add(y, x);

     }

     for(i = ; i <= n; i++) a[i] = read();

     dfs();

     for(i = ; i <= n; i++)

     {

         tot = (tot + ans[i]) % p;

         max = Max(max, max1[i] * max2[i]);

     }

     printf("%lld %lld\n", max, (tot << ) % p);

     return ;

 }