Tietoverkko

// C++ implementation to count the
// number of ways to partition the
// string such that each partition
// have same number of distinct
// characters in the string
 
#include <bits/stdc++.h>

using namespace std; 
int N;
vector<pair<int,int>> v[200000];
long long int sum;

void haku(int s, int e, int target){
    if(e!=0)
    sum+=target; 
    
    for(auto u: v[s]){
        if(u.first!=e&&u.second>=target) haku(u.first, s, target);
    }


}

void syvahaku(int r, int e, int weight){
    if(e!=0)
    haku(r, 0, weight );
    for(auto u: v[r]){
        if(u.first!=e) syvahaku(u.first, r, u.second);
    }
}



   
int main()
{
    long long int i, a,b,c;
    sum=0; 

    cin>>N; 
    
    for(i=0; i<N-1; i++){
        cin>>a>>b>>c;
        v[a].push_back({b,c});
        v[b].push_back({a,c});
    }
    syvahaku(v[1][0].first, 0, v[1][0].second);
    cout<<sum;
  
    return 0;
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: RUNTIME ERROR

terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc