1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <climits>
 7 #include <vector>
 8 #include <queue>
 9 #include <cstdlib>
10 #include <string>
11 #include <set>
12 #include <stack>
13 #define LL long long
14 #define pii pair<int,int>
15 #define INF 0x3f3f3f3f
16 using namespace std;
17 const int maxn = 110;
18 struct arc{
19     int to,flow,cost,next;
20     arc(int x = 0,int y = 0,int z = 0,int nxt = -1){
21         to = x;
22         flow = y;
23         cost = z;
24         next = nxt;
25     }
26 };
27 arc e[maxn*maxn];
28 int head[maxn],d[maxn],p[maxn],tot,n,m,S,T;
29 void add(int u,int v,int flow,int cost){
30     e[tot] = arc(v,flow,cost,head[u]);
31     head[u] = tot++;
32     e[tot] = arc(u,0,-cost,head[v]);
33     head[v] = tot++;
34 }
35 bool spfa(){
36     queue<int>q;
37     bool in[maxn] = {false};
38     for(int i = S; i <= T; ++i) p[i] = -1,d[i] = INF;
39     d[S] = 0;
40     q.push(S);
41     while(!q.empty()){
42         int u = q.front();
43         q.pop();
44         in[u] = false;
45         for(int i = head[u]; ~i; i = e[i].next){
46             if(e[i].flow && d[e[i].to] > d[u] + e[i].cost){
47                 d[e[i].to] = d[u] + e[i].cost;
48                 p[e[i].to] = i;
49                 if(!in[e[i].to]) {
50                     in[e[i].to] = true;
51                     q.push(e[i].to);
52                 }
53             }
54         }
55     }
56     return p[T] > -1;
57 }
58 bool solve(int &ans){
59     int flow = ans = 0;
60     while(spfa()){
61         int minFlow = INF;
62         for(int i = p[T]; ~i; i = p[e[i^1].to])
63             minFlow = min(e[i].flow,minFlow);
64         for(int i = p[T]; ~i; i = p[e[i^1].to]){
65             e[i].flow -= minFlow;
66             e[i^1].flow += minFlow;
67         }
68         flow += minFlow;
69         ans += d[T]*minFlow;
70     }
71     return flow == 2;
72 }
73 int main() {
74     while(~scanf("%d %d",&n,&m)){
75         tot = S = 0;
76         T = n + 1;
77         int u,v,w;
78         memset(head,-1,sizeof(head));
79         for(int i = 0; i < m; ++i){
80             scanf("%d %d %d",&u,&v,&w);
81             add(u,v,1,w);
82             add(v,u,1,w);
83         }
84         add(S,1,2,0);
85         add(n,T,2,0);
86         int ans;
87         if(solve(ans)) printf("%d\n",ans);
88         else puts("eating");
89     }
90     return 0;
91 }