#include <bits/stdc++.h>
namespace IO {
const int SIZE = (1 << 20) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = obuf + SIZE - 1;
char _st[55];
int _qr = 0;
inline char gc() {
  return (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
          (iS == iT ? EOF : *iS++) : *iS++);
}
inline void qread() {}
template <class T1, class... T2>
inline void qread(T1 &IEE, T2 &...ls) {
  register T1 __ = 0, ___ = 1;
  register char ch;
  while (!isdigit(ch = gc())) ___ = (ch == '-') ? -___ : ___;
  do {
    __ = (__ << 1) + (__ << 3) + (ch ^ 48);
  } while (isdigit(ch = gc()));
  __ *= ___;
  IEE = __;
  qread(ls...);
  return;
}
template <class T>
inline void QreadArr(T Begin, T End) {
  while (Begin != End) {
    qread(*Begin);
    ++Begin;
  }
}
inline void flush() {
  fwrite(obuf, 1, oS - obuf, stdout);
  oS = obuf;
  return;
}
inline void putc_(char _x) {
  *oS++ = _x;
  if (oS == oT) flush();
}
inline void qwrite() {}
template <class T1, class... T2>
inline void qwrite(T1 IEE, T2... ls) {
  if (!IEE) putc_('0');
  if (IEE < 0) putc_('-'), IEE = -IEE;
  while (IEE) _st[++_qr] = IEE % 10 + '0', IEE /= 10;
  while (_qr) putc_(_st[_qr--]);
  qwrite(ls...);
  return;
}
template <class T>
inline void WriteArr(T Begin, T End) {
  const char Kg = ' ', Edl = '\n';
  while (Begin != End) {
    qwrite(*Begin);
    ++Begin;
    putc_(Kg);
  }
  putc_(Edl);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_flusher;
}  // namespace IO
using namespace IO;
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
long long My_Rand(long long Mod) { return (unsigned long long)(rnd()) % Mod; }
template <class T1, class T2>
T1 Min(const T1 x, const T2 y) {
  return x > y ? y : x;
}
template <class T1, class T2>
T1 Max(const T1 x, const T2 y) {
  return x > y ? x : y;
}
template <class T1, class T2>
void To_max(T1 &x, const T2 y) {
  x < y ? x = y : x = x;
}
template <class T1, class T2>
void To_min(T1 &x, const T2 y) {
  x > y ? x = y : x = x;
}
inline long long qmul(long long x, long long y, long long p) {
  long long l = x * (y >> 25) % p * (1 << 25) % p;
  long long r = x * (y & ((1 << 25) - 1)) % p;
  return (l + r) % p;
}
inline long long qpow(long long n, long long base, long long mod = 1e18) {
  long long ret = 1;
  while (n) {
    if (n & 1) ret = ret * base % mod;
    base = base * base % mod;
    n >>= 1;
  }
  return ret % mod;
}
inline long long gcd(long long x, long long y) {
  return !y ? x : gcd(y, x % y);
}
inline long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
void InitHash(unsigned long long &base, int &prime, unsigned long long &mod) {
  base = 131, prime = 233317, mod = 212370440130137957ll;
}
const int N = 2e5 + 5;
struct Edge {
  int u, v, w, id;
  bool operator<(const Edge &oth) const { return w < oth.w; }
} ee[N], e[N];
int n, m;
int head[N], cnt;
pair<pair<int, int>, int> E[N << 1];
int f[N];
long long ans;
bool vis[N];
int dep[N], mx[N][21], fa[N][21];
int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }
void Add(int u, int v, int w) {
  E[++cnt] = make_pair(make_pair(v, w), head[u]);
  head[u] = cnt;
}
void Kruskal() {
  int cn = 1;
  sort(e + 1, e + m + 1);
  for (int i = (1); i <= (n); ++i) f[i] = i;
  for (int i = (1); i <= (m); ++i) {
    int u = find(e[i].u), v = find(e[i].v);
    if (u == v) continue;
    vis[e[i].id] = true;
    Add(e[i].u, e[i].v, e[i].w), Add(e[i].v, e[i].u, e[i].w);
    ++cn;
    ans += e[i].w;
    f[u] = v;
    if (cn == n) return;
  }
}
void dfs(int u, int Fa) {
  dep[u] = dep[Fa] + 1;
  fa[u][0] = Fa;
  for (int i = (1); i <= (20); ++i) fa[u][i] = fa[fa[u][i - 1]][i - 1];
  for (int i = (1); i <= (20); ++i)
    mx[u][i] = max(mx[u][i - 1], mx[fa[u][i - 1]][i - 1]);
  for (int i = head[u]; i; i = E[i].second) {
    int v = E[i].first.first, w = E[i].first.second;
    if (v == Fa) continue;
    mx[v][0] = w;
    dfs(v, u);
  }
}
int LCA(int x, int y) {
  int ret = -1;
  if (dep[x] < dep[y]) swap(x, y);
  int t = dep[x] - dep[y];
  for (int i = (0); i <= (20); ++i)
    if (t & (1 << i)) To_max(ret, mx[x][i]), x = fa[x][i];
  if (x == y) return ret;
  for (int i = (20); i >= (0); --i)
    if (fa[x][i] != fa[y][i])
      To_max(ret, max(mx[x][i], mx[y][i])), x = fa[x][i], y = fa[y][i];
  To_max(ret, max(mx[x][0], mx[y][0]));
  return ret;
}
int main() {
  qread(n, m);
  for (int i = (1); i <= (m); ++i)
    qread(e[i].u, e[i].v, e[i].w), e[i].id = i, ee[i] = e[i];
  Kruskal();
  dfs(1, 0);
  for (int i = (1); i <= (m); ++i) {
    if (vis[i]) {
      printf("%lld\n", ans);
      continue;
    }
    printf("%lld\n", ans + ee[i].w - LCA(ee[i].u, ee[i].v));
  }
  return 0;
}
