#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int INF=1e9+10;
const int N=2e5+10;
const int MOD=10007;
int n,x,y,a[N],maxn,sum=0;
vector<int>v[N];
int Max[N][2],Sum[N][2];

void dfs1(int x,int deep,int fa,int root){
	if(deep==2){maxn=max(maxn,a[root]*a[x]);sum=(sum+a[root]*a[x])%MOD;}
	else {
		for(int i=0;i<v[x].size();i++){
			if(fa!=v[x][i])
				dfs1(v[x][i],deep+1,x,root);
		}
	}
}

void dfs(int x,int fa){
	int maxn1=0,maxn2=0,mi=0;
	for(int i=0;i<v[x].size();i++)if(v[x][i]!=fa){
		if(maxn1<a[v[x][i]])maxn1=a[v[x][i]],mi=i;
		Sum[x][0]=(Sum[x][0]+a[v[x][i]])%MOD;
		sum=sum-((a[v[x][i]]*a[v[x][i]])%MOD);
		Max[x][0]=max(Max[x][0],a[v[x][i]]);
		dfs(v[x][i],x);
		Sum[x][1]=(Sum[x][1]+Sum[v[x][i]][0])%MOD;
		Max[x][1]=max(Max[x][1],Max[v[x][i]][0]);
	}
	sum=(sum+2*Sum[x][1]*a[x])%MOD;
	sum=(sum+(Sum[x][0]%MOD)*(Sum[x][0]%MOD))%MOD;
	while(sum<0)sum+=MOD;
	for(int i=0;i<v[x].size();i++)if(v[x][i]!=fa&&mi!=i){
		maxn2=max(maxn2,a[v[x][i]]);
	}
	maxn=max(maxn,max(Max[x][1]*a[x],maxn1*maxn2));
}

int main(){
	freopen("linkb.in","r",stdin);	freopen("linkb.out","w",stdout);
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=1;i<n;i++){
		cin>>x>>y;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	for(int i=1;i<=n;i++)cin>>a[i];
	/*if(n<=2000)
	{
		for(int i=1;i<=n;i++){
			dfs1(i,0,i,i);
		}
		cout<<maxn<<" "<<sum%MOD<<endl; 
	}
	//else*/ 
	{
	int cnt=1;
	for(int i=1;i<=10006;i++)cnt=(cnt*2)%MOD;
		dfs(1,1);
		cout<<maxn<<" "<<(sum*cnt)%MOD<<endl;
	}
	return 0;
}