hunnu 10682 Invitation Cards

typedef long long llt ;

#define MOD  1000000007
const int maxn = 150000;
#define LEFT 0
#define RIGHT 1

//cout.sync_with_stdio(false);  /// cin, 不能跟 scanf，sscanf, getchar, fgets之类的一起使用
//freopen("cin.txt", "r", stdin);
//freopen("cout.txt", "w", stdout);
typedef int  weight_t;
const int SIZE_E = 1000010;
const int SIZE_V = 1000010;
struct edge_t{
    int v;
    weight_t w;
    edge_t *next;
}Edge[SIZE_E];

edge_t *V[SIZE_V];
int n,m;
int ECnt = 0;

void mkEdge(int a,int b,weight_t w){
    Edge[ECnt].v = b;
    Edge[ECnt].w = w;
    Edge[ECnt].next = V[a];
    V[a] = Edge+ECnt++;

//    Edge[ECnt].v = a;
//    Edge[ECnt].w = w;
//    Edge[ECnt].next = V[b];
//    V[b] = Edge+ECnt++;
}

weight_t D[SIZE_V];
bool flag[SIZE_V];

void spfa(int s){

    MEM(flag,0);
    fill(D,D+n+1,INT_MAX);
    D[s] = 0;
    flag[s] = true;

    queue<int>q;
    q.push(s);
    while(!q.empty()){
        int u = q.front();
        q.pop();
        flag[u] = false;

        for(edge_t *p = V[u];p;p = p->next){

            int v = p->v;
            weight_t temp = D[u] + p->w;
            if (temp < D[v]){

                D[v] = temp;
                if (!flag[v]){
                    flag[v] = true;
                    q.push(v);
                }
            }
        }
    }
}

void init(){
    ECnt = 0;
    memset(V,0,sizeof(V));
}
int a[SIZE_E],b[SIZE_E];
weight_t w[SIZE_E];

void read(){
    init();
    scanf("%d%d",&n,&m);

    for (int i = 0;i < m;++i){
        scanf("%d%d%d",a+i,b+i,w+i);
        mkEdge(a[i],b[i],w[i]);
    }
}
void reread(){
    init();
    for (int i = 0;i < m;++i){
        mkEdge(b[i],a[i],w[i]);
    }
}
int main(){
    int kase;
    scanf("%d",&kase);
    while(kase--){
        read();
        llt ans = 0;
        spfa(1);
        for (int i = 2;i <= n;++i)
            ans+=D[i];
        reread();
        spfa(1);
        for (int i = 2;i <= n;++i)
            ans+=D[i];

        printf("%I64d\n",ans);
    }
    return 0;
}