1 #include<iostream>
 2 #include<cstdio>
 3 #include<algorithm>
 4 #include<cstring>
 5 #include<cmath>
 6 #include<deque>
 7 using namespace std;
 8
 9 int N,K,X,A,B,cnt,f;
10 int first[100010],next[400010],rd[100010];
11 long long de[100010],ans;
12 bool used[100010];
13
14 struct maple{
15    int f,t,d;
16 }Rode[400010];
17 deque<int> q;
18
19 void Build(int f,int t,int d)
20 {
21     Rode[++cnt]=(maple){f,t,d};
22     next[cnt]=first[f];
23     first[f]=cnt;
24 }
25 void SPFA() // 跑最长路
26 {
27     used[0]=1;
28     de[0]=1;  // 保证每个人都分到糖果
29     q.push_back(0);
30     while(!q.empty())
31     {
32         int a=q.front();
33         q.pop_front();
34         used[a]=0;
35         for(int i=first[a];i;i=next[i])
36            if(de[Rode[i].t]<de[a]+Rode[i].d)
37            {
38                   de[Rode[i].t]=de[a]+Rode[i].d;
39                   if(!used[Rode[i].t])
40                   {
41                          used[Rode[i].t]=1;
42                          if(!q.empty()&&de[Rode[i].t]>=de[q.front()]) q.push_front(Rode[i].t);
43                          else q.push_back(Rode[i].t);
44                          ++rd[Rode[i].t];
45                          if(rd[Rode[i].t]>=N)  // 判断是否有解
46                          {
47                                 f=1;
48                                 break;
49                          }
50                   }
51            }
52         if(f) break;
53     }
54 }
55 int main()
56 {
57     scanf("%d%d",&N,&K);
58     for(int i=1;i<=K;++i)
59     {
60         scanf("%d%d%d",&X,&A,&B);
61         if(X==1) Build(A,B,0),Build(B,A,0); // A = B
62         if(X==2) Build(A,B,1);   // B - A > = 1
63         if(X==3) Build(B,A,0);   // A - B > = 0
64         if(X==4) Build(B,A,1);   // A - B > = 1
65         if(X==5) Build(A,B,0);   // B - A > = 0
66     }
67     for(int i=1;i<=N;++i) Build(0,i,0); // i - 0 > = 0
68     SPFA();
69     if(f) cout<<-1;
70     else{
71         for(int i=1;i<=N;++i)
72            ans+=de[i];
73         printf("%lld",ans);
74     }
75     return 0;
76 }