Alternate of arghya

#include<bits/stdc++.h>

using namespace std;

#define ll long long int
#define db(x) cout<<#x<<" -> "<<x<<endl
#define maxn 100005
#define IN freopen("judgeInput.txt","r",stdin)
#define OUT freopen("myOutput.txt","w",stdout)

typedef pair<int,int> pii;
vector< int > g[maxn];
int main(){
    IN;OUT;
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t;
    int tc= 0;
    cin>>t;
    while(t--){
        int n,m;
        cin>>n>>m;
        vector< pii > vt(n+5,{0,0});
        for(int i=1; i<=m; i++){
            int u,v,z;
            cin>>u>>v>>z;
            if(!z){
                vt[u].first++; ///friend
                vt[v].first++;
            }
            else{
                vt[u].second++; ///enmity
                vt[v].second++;
            }
            g[u].push_back(v);
        }
        int ans = -10000000;
        for(int i=1; i<=n; i++){
            int x = vt[i].first-vt[i].second;
            for(int j=0; j<g[i].size(); j++){
                int y = vt[g[i][j]].first-vt[g[i][j]].second;
                ans  = max(ans,x+y);
            }
        }
        printf("Case %d: %d\n",++tc,ans);
        for(int i=1; i<=n; i++){
            g[i].clear();
        }
    }
    return 0;
}