#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
  for (ll i = ll(0); i < ll(ll(first.size())); i++)
    swap(first[i], first[rand_int(0, i)]);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
template <class d>
struct maxflow {
  struct E {
    ll to, rev;
    d cap;
  };
  vvc<E> g;
  vi itr, lv, q;
  maxflow(ll n) : g(n), itr(n), lv(n), q(n) {}
  ll ae(ll s, ll t, d c) {
    g[s].push_back({t, (ll)g[t].size(), c});
    g[t].push_back({s, (ll)g[s].size() - 1, 0});
    return ll(g[s].size()) - 1;
  }
  void bfs(ll s) {
    fill(lv.begin(), lv.end(), -1);
    lv[s] = 0;
    ll l = 0, r = 0;
    q[r++] = s;
    while (l < r) {
      ll v = q[l++];
      for (auto e : g[v])
        if (e.cap > 0 && lv[e.to] == -1) {
          lv[e.to] = lv[v] + 1;
          q[r++] = e.to;
        }
    }
  }
  d dfs(ll v, ll t, d f) {
    if (v == t) return f;
    d res = 0;
    for (ll& i = itr[v]; i < (ll)g[v].size(); i++) {
      E& e = g[v][i];
      if (e.cap > 0 && lv[e.to] == lv[v] + 1) {
        d first = dfs(e.to, t, min(f, e.cap));
        if (first > 0) {
          e.cap -= first;
          g[e.to][e.rev].cap += first;
          res += first;
          f -= first;
          if (f <= 0) break;
        }
      }
    }
    return res;
  }
  d calc(ll s, ll t, d mx = inf) {
    d f = 0;
    while (1) {
      bfs(s);
      if (lv[t] == -1) return f;
      fill(itr.begin(), itr.end(), 0);
      f += dfs(s, t, mx - f);
    }
    return f;
  }
};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n, m, s, t;
  cin >> n >> m >> s >> t;
  s--;
  t--;
  maxflow<ll> mf(n);
  vvc<pi> g(n);
  vc<pi> es(m);
  vi tp(m);
  vc<pi> idx(m, pi(-1, -1));
  vi ans(m);
  for (ll i = ll(0); i < ll(m); i++) {
    ll first, second;
    cin >> first >> second >> tp[i];
    first--;
    second--;
    es[i] = pi(first, second);
    if (tp[i] == 0) {
      mf.ae(first, second, inf);
    } else {
      idx[i] = pi(first, mf.ae(first, second, 1));
      mf.ae(second, first, inf);
      g[first].emplace_back(second, i);
    }
  }
  vi side(n);
  auto add = [&](vi froms, vi tos, ll md = 0) {
    for (auto from : froms) assert(side[from] == side[tos[0]]);
    for (auto to : tos) assert(side[froms[0]] == side[to]);
    vi dist(n, -1), pre(n, -1), use(n, -1);
    vi q(n);
    ll second = 0, e = 0;
    auto reach = [&](ll v, ll d, ll p, ll u) {
      if (side[v] != side[froms[0]]) return;
      if (dist[v] != -1) return;
      dist[v] = d;
      pre[v] = p;
      use[v] = u;
      q[e++] = v;
    };
    vi fid(n, -1);
    for (ll i = ll(0); i < ll(ll(froms.size())); i++) {
      ll from = froms[i];
      fid[from] = i;
      reach(from, 0, -1, -1);
    }
    while (second < e) {
      ll v = q[second++];
      for (auto z : g[v]) reach(z.first, dist[v] + 1, v, z.second);
    }
    for (ll i = ll(0); i < ll(ll(tos.size())); i++) {
      ll to = tos[i];
      if (dist[to] != -1) {
        while (fid[to] == -1) {
          ans[use[to]]++;
          to = pre[to];
        }
        return pi(fid[to], i);
      }
    }
    if (md == 0) assert(0);
    return pi(-1, -1);
  };
  ll f = mf.calc(s, t);
  for (ll i = ll(0); i < ll(n); i++)
    if (mf.lv[i] == -1) side[i] = 1;
  vi cut[2], ci;
  for (ll i = ll(0); i < ll(m); i++)
    if (tp[i]) {
      ll first, second;
      tie(first, second) = es[i];
      if (side[first] != side[second]) {
        assert(side[first] < side[second]);
        tp[i] = 2;
        cut[0].push_back(first);
        cut[1].push_back(second);
        ci.push_back(i);
      }
    }
  for (ll i = ll(0); i < ll(m); i++)
    if (tp[i]) {
      ans[i]++;
      if (tp[i] == 1) {
        if (add({es[i].second}, {es[i].first}, 1) != pi(-1, -1)) continue;
        if (side[es[i].first] == 0) {
          add({s}, {es[i].first});
          ll u = add({es[i].second}, cut[0]).second;
          ans[ci[u]]++;
          add({cut[1][u]}, {t});
        } else {
          add({es[i].second}, {t});
          ll u = add(cut[1], {es[i].first}).first;
          ans[ci[u]]++;
          add({s}, {cut[0][u]});
        }
      } else {
        add({s}, {es[i].first});
        add({es[i].second}, {t});
      }
    }
  print(f);
  for (ll i = ll(0); i < ll(m); i++) {
    ll first = ans[i], second = ans[i];
    if (tp[i] < 2) second++;
    print(first, 2);
    print(second);
  }
}
