#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
constexpr int kN = 1024;
struct Edge {
    int uv, w, id;
} E[kN];
vector<int> G[kN];
vector<pii> H[16][kN];
int sz[kN];
void get_cent(int u, int f, int &mx, int &c, int num, int mask, int subid) {
    int mxsz = 0;
    sz[u] = 1;
    for (int i : G[u]) {
        const int v = E[i].uv ^ u, id = E[i].id;
        if (v == f || (id & mask) != subid) continue;
        get_cent(v, u, mx, c, num, mask, subid);
        sz[u] += sz[v], mxsz = max(mxsz, sz[v]);
    }
    int tmp = max(mxsz, num - sz[u]);
    if (mx > tmp) mx = tmp, c = u;
}
void H_addedge(int u, int i, int layer, int neg) {
    const int v = E[i].uv ^ u, w = E[i].w;
    E[i].id |= neg << layer;
    if (neg) {
        H[layer][u].emplace_back(v, -w);
        H[layer][v].emplace_back(u, +w);
    } else {
        H[layer][u].emplace_back(v, +w);
        H[layer][v].emplace_back(u, -w);
    }
}
void dfs(int u, int f, int layer, int mask, int subid, int neg) {
    for (int i : G[u]) {
        const int v = E[i].uv ^ u;
        if (v == f || (E[i].id & mask) != subid) continue;
        H_addedge(u, i, layer, neg);
        dfs(v, u, layer, mask, subid, neg);
    }
}
void cut(int u, int num, int layer, int mask, int subid) {
    if (num <= 2) return;
    int mx = 1e9, c = 0;
    get_cent(u, 0, mx, c, num, mask, subid);
    assert(sz[u] == num);
    pair<int, vector<int>> s[3];
    for (int i : G[c]) {
        const int v = E[i].uv ^ c;
        if ((E[i].id & mask) != subid) continue;
        const int szv = sz[v] > sz[c] ? num - sz[c] : sz[v];
        int pos = 1;
        if (s[1].first) pos = 2;
        else if (s[0].first + szv <= num / 2) pos = 0;
        s[pos].first += szv;
        s[pos].second.push_back(i);
    }
    sort(s, s + 3);
    assert(s[0].first + s[1].first);
    for (int j = 0; j < 3; ++j) {
        for (int i : s[j].second) {
            int neg = j == 2;
            H_addedge(c, i, layer, neg);
            dfs(E[i].uv ^ c, c, layer, mask, subid, neg);
        }
    }
    cut(c, s[0].first + s[1].first + 1, layer + 1, mask * 2 + 1, subid);
    cut(c, s[2].first + 1, layer + 1, mask * 2 + 1, subid | (1 << layer));
}
int embedding[kN][16];
bool vis[kN];
void solve(int n) {
    if (n == 2) {
        cout << "1\n0\n" << E[1].w << '\n';
        exit(0);
    }
    cut(1, n, 0, 0, 0);
    for (int l = 0; l < 16; ++l) {
        fill_n(vis + 1, n, false);
        queue<int> q;
        vis[1] = true, q.push(1);
        while (!q.empty()) {
            int u = q.front(); q.pop();
            for (auto [v, w] : H[l][u]) {
                if (vis[v]) continue;
                embedding[v][l] = embedding[u][l] + w;
                vis[v] = true, q.push(v);
            }
            for (int i : G[u]) {
                const int v = E[i].uv ^ u;
                if (vis[v]) continue;
                embedding[v][l] = embedding[u][l];
                vis[v] = true, q.push(v);
            }
        }
    }
    cout << 16 << '\n';
    for (int u = 1; u <= n; ++u) {
        for (int l = 0; l < 16; ++l) {
            cout << embedding[u][l] << " \n"[l == 15];
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    for (int i = 1; i < n; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        E[i] = {u ^ v, w, 0};
        G[u].push_back(i);
        G[v].push_back(i);
    }
    solve(n);
    return 0;
}