#include <bits/stdc++.h>
using namespace std;
using ll=long long;
vector<ll> g[50001];
ll c[500001];
vector<pair<ll,int>> db ; 
bool seen[50001];
ll dfs(int x){
	seen[x]=true; 
	if (c[x]==0){
		db[x]={1,x};
		return db[x].first;
	} 
	else{
		for (int edge:g[x]){
			if (!seen[edge]) db[x].first+=dfs(edge);
			else db[x].first+=db[edge].first; 
		}
		db[x].second=x; 

	}
	return (db[x].first);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;

vector<int> p;
p.resize(n+1);
for (int i=1;i<n;i++)
{
ll x,y;
cin>>x>>y;
db.assign(n+1, {1,0}); 
c[x]++; 
p[y]=x;
g[x].push_back(y);

}
vector<ll> arak(n-1);
for (int i=0; i<n-1;i++){
	cin>>arak[i];
}

dfs(1);
for (int i=1; i<=n;i++) db[i].first=db[i].first*(n-db[i].first);

sort(db.begin(), db.end());
sort(arak.begin(), arak.end());


ll ans=0; 
vector<pair<pair<ll, ll>,ll>> cnt(n-1); 
for (int i=2; i<=n;i++){
	ans+=db[i].first*arak[i-2]*2;
	ans=ans%32609;
	cnt[i-2]={{db[i].second, p[db[i].second]},arak[i-2]};
}
cout<<ans<<endl; 
for (auto x: cnt) cout<<x.first.second<<" "<<x.first.first<<" "<<x.second<<"\n"; 

}