#include <bits/stdc++.h> #define int long long using namespace std; const long long N = 2e5 + 5; int a[N]; int mn[N]; int mx[N]; struct edge { int v, l, r; }; vector<edge> graph[N]; void dfs(int node, int parent) { // cout << node << endl; for (auto i : graph[node]) { if (i.v == parent) continue; // cout << i.v << " " << node << endl; mx[i.v] = max(mx[node], i.r); // cout << mx[i.v] << " " << node << endl; mn[i.v] = min(mn[node], i.l); dfs(i.v, node); } } void solve() { int n, m; cin >> n >> m; int u, v, l, r; for (int i = 0; i < n - 1; i++) { cin >> u >> v >> l >> r; graph[u].push_back({v, l, r}); graph[v].push_back({u, l, r}); } mx[1] = -1; mn[1] = 1e18; dfs(1, 0); for (int i = 2; i <= n; i++) { cout << 1 + mx[i] - mn[i] << endl; } } signed main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int t = 1; // cin >> t; for (int i = 1; i <= t; i++) { // cout << "Case #" << i << ':' << ' '; solve(); cout << endl; } return 0; }