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

vector<vector<int>> csucs(50001);
vector<long long> adok(50001), visited(50001, 0);
priority_queue<pair<long long, pair<long long, long long>>> ansok;
vector<int> osszeg(50001, 0);
int osszegmost = 0;

void dfs(long long st)
{
    visited[st] = 1;
    if (csucs[st].size() == 1)
    {
        osszeg[st] = 1;
        return;
    }
    long long sum = 0;

    for (int i : csucs[st])
    {
        if (!visited[i])
        {
            dfs(i);
            ansok.push({osszeg[i], {st, i}});
            sum += osszeg[i];
        }
    }

    osszeg[st] = sum;
}

int main()
{

    int n;
    cin >> n;

    for (int i = 0; i < n - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        csucs[a].push_back(b);
        csucs[b].push_back(a);
    }

    for (int i = 0; i < n - 1; i++) {
        cin >> adok[i];
    }
    
    sort(adok.begin(), adok.begin()+n-1);

    dfs(1);
    osszeg[1]++;

    vector<pair<pair<int, int>, int>> ans;

    for (int i = n - 2; i >= 0; i--)
    {
        auto x = ansok.top();
        ansok.pop();
        ans.push_back({{x.second.first, x.second.second}, adok[i]});
        osszegmost += x.first * adok[i] * 2 % 32609;
    }
    cout << osszegmost << '\n';
    for (int i = 0; i < n - 1; i++)
    {
        cout << ans[i].first.first << ' ' << ans[i].first.second << ' ' << ans[i].second << '\n';
    }
    return 0;
}