#include <bits/stdc++.h>
using namespace std;
#define InTheNameOfGod ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
using ll = long long;

const ll maxN = 2e5 + 5;
const ll MOD = 1e9 + 7;

ll n;
vector<vector<ll> > g;
vector<ll> v, cnt;

vector<pair<ll, pair<ll, ll> > > mo;

ll count(ll x, ll p) {
    ll ret = 1;
    for(ll sz : g[x]) {
        if(sz == p) continue;
        ret += count(sz, x);
    }

    return cnt[x] = ret;
}

void solve(ll x, ll p) {
    for(ll sz : g[x]) {
        if(sz == p) continue;
        mo.push_back({cnt[sz] * (n-cnt[sz]), {sz, x}});
        solve(sz, x);
    }
}


int main() {
   InTheNameOfGod;

    
    cin >> n;

    g.resize(n+1);
    v.resize(n-1);
    cnt.resize(n+1);

    for(ll i = 0; i < n-1; i++) {
        ll x,y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    for(ll &i : v) cin >> i;

    count(1, -1);
    solve(1, -1);

    sort(v.begin(), v.end());
    sort(mo.begin(), mo.end());


    ll ki = 0;
    for(ll i = 0; i < n-1; i++) {
        ki += mo[i].first * v[i] * 2;
        ki %= 32609;
    }
    cout << ki << "\n";
    for(ll i = 0; i < n-1; i++) {
        cout << mo[i].second.first << " " << mo[i].second.second << " " << v[i] << "\n";
    }

    return 0;
}