#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
	int len=0;
	char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
	#if ONLINE_JUDGE
	#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
 	#else
	#define gh() getchar()
	#endif
	#define reg register
	inline int read(){
		reg char ch=gh();
		reg int x=0;
		reg char t=0;
		while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
		return t?-x:x;
	}
	inline void putc(char ch){
		out[len++]=ch;
	}
	template<class T>
	inline void write(T x){
		if(x<0)putc('-'),x=-x;
		if(x>9)write(x/10);
		out[len++]=x%10+48;
	}
	inline void flush(){
		fwrite(out,1,len,stdout);
		len=0;
	}
	inline char getc(){
		char ch=gh();
		while(ch<'A'||ch>'Z') ch=gh();
		return ch;
	}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
#define pii pair<int,int>
#define mpr make_pair
#define fir first
#define sec second
const int N=1e4+10,M=1e6+10;
struct Edge{
	int u,v,w;
	inline friend bool operator<(const Edge &a,const Edge &b){
		return a.w<b.w;
	}
}a[M],b[M],c[M],d[M];
int n,m,k,c1,c2,c3;
struct DSU{
	int fa[N],siz[N];
	inline void init(int n){
		for(int i=1;i<=n;i++)
			siz[fa[i]=i]=1;
	}
	inline int find(int x){
		return x==fa[x]?x:fa[x]=find(fa[x]);
	}
	inline bool unnion(int x,int y){
		x=find(x),y=find(y);
		if(x==y) return 0;
		if(siz[x]<siz[y]) swap(x,y);
		fa[y]=x,siz[x]+=siz[y];
		return 1;
	}
}D;
inline ll calc(ll x){
	for(int i=1;i<=c2;i++)
		c[i]={b[i].u,b[i].v,b[i].w-x};
	merge(a+1,a+c1+1,c+1,c+c2+1,d+1);
	D.init(n);
	ll s=0;
	for(int i=1;i<=m;i++)
		if(D.unnion(d[i].u,d[i].v))
			s+=d[i].w;
	return s;
}
inline ll solve(int k){
	ll L=-1e14,R=1e14;
	while(L<R){
		ll mL=L+R>>1,mR=mL+1;
		ll v1=calc(mL)+1ll*mL*k,v2=calc(mR)+1ll*mR*k;
		if(v1==v2) return v1;
		if(v1<v2) L=mL+1;
		else R=mR-1;
	}
	return calc(L)+1ll*L*k;
}
int main(){
	n=read(),m=read(),k=read();
	for(int i=1;i<=k;i++){
		int u=read(),v=read(),w=read();
		b[++c2]={u,v,w};
	}
	for(int i=k+1;i<=m;i++){
		int u=read(),v=read(),w=read();
		a[++c1]={u,v,w};
	}
	sort(a+1,a+c1+1);
	sort(b+1,b+c2+1);
	D.init(n);
	for(int i=1;i<=c1;i++)
		if(D.unnion(a[i].u,a[i].v))
			d[++c3]=a[i];
	for(int i=1;i<=c3;i++)
		a[i]=d[i];
	c1=c3;
	for(int i=0;i<=k;i++)
		write(solve(i)),putc('\n');
	flush();
}