#include<cstdio>
typedef unsigned long long ll;
const int D=200,N=5002,M=262143;
int d,n,m,i,j,x,y,z,ans;
int f[D][N],s[D][N],g[D][N],v[D*N*2],nxt[D*N*2],ed;
ll pow[D],h[N];
struct E{ll v;int w,nxt;}e[N];
int G[M+1],res[N],cur;
inline void read(int&a){char c;while(!(((c=getchar())>='0')&&(c<='9')));a=c-'0';while(((c=getchar())>='0')&&(c<='9'))(a*=10)+=c-'0';}
inline void add(int z,int x,int y){v[++ed]=y;nxt[ed]=g[z][x];g[z][x]=ed;}
inline void ins(ll v){int u=v&M,i=G[u];for(;i;i=e[i].nxt)if(e[i].v==v){ans+=e[i].w*2+1;e[i].w++;return;}ans++,e[i=res[cur--]].v=v,e[i].w=1,e[i].nxt=G[u],G[u]=i;
}
inline void del(ll v){int u=v&M,i=G[u],j=i;if(e[i].v==v){ans-=e[i].w*2-1;if(!(--e[i].w))G[u]=e[res[++cur]=i].nxt;return;}for(i=e[i].nxt;i;j=i,i=e[i].nxt)if(e[i].v==v){ans-=e[i].w*2-1;if(!(--e[i].w))e[j].nxt=e[res[++cur]=i].nxt;return;}
}
void dfs(int z,int x,int y,int t){del(h[x]);h[x]-=pow[z]*f[z][x];f[z][x]=t;ins(h[x]+=pow[z]*t);for(int i=g[z][x];i;i=nxt[i])if(v[i]!=y)dfs(z,v[i],x,t);
}
inline void merge(int z,int x,int y){if(f[z][x]==f[z][y])return;if(s[z][f[z][x]]>s[z][f[z][y]]){int t=x;x=y;y=t;}s[z][f[z][y]]+=s[z][f[z][x]];add(z,x,y),add(z,y,x);dfs(z,x,y,f[z][y]);
}
int main(){read(d),read(n),read(m);for(pow[0]=i=1;i<d;i++)pow[i]=pow[i-1]*10007;for(i=1;i<=n;i++)res[++cur]=i;for(i=1;i<=n;ins(h[i++]))for(j=0;j<d;j++)f[j][i]=i,s[j][i]=1,h[i]+=pow[j]*i;while(m--)read(x),read(y),read(z),merge(--z,x,y),printf("%d\n",ans);return 0;
}