#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<cstdlib>
using namespace std;
int n,m,fa[10005];
bool vis[10005];
struct node
{
    int x,y,w;
}e[100005];
int find(int x)
{
    if(x!=fa[x])
        fa[x]=find(fa[x]);
    return fa[x];
}
bool cmp(node a,node b)
{
    return  a.w>b.w;
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==0&&m==0)
            break;
        int ans=0;
        for(int i=0;i<n;i++)
            fa[i]=i,vis[i]=0;
        for(int i=1;i<=m;i++)
            scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].w);
        sort(e+1,e+1+m,cmp);
        for(int i=1;i<=m;i++)
        {
            int fx,fy;
            fx=find(e[i].x),fy=find(e[i].y);
            if(fx!=fy)
            {
                if(!vis[fx]&&!vis[fy])
                {
                    ans+=e[i].w;
                    fa[fx]=fy;
                }
                else if(!vis[fx]||!vis[fy])
                {
                    ans+=e[i].w;
                    vis[fx]=vis[fy]=1;
                }
            }
            else
            {
                if(!vis[fx]&&!vis[fy])
                {
                    ans+=e[i].w;
                    vis[fx]=vis[fy]=1;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}