#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <string.h>
#include <numeric>
using namespace std;

//#define int long long
#define reps(i,s,n) for(int (i)=(s);(i)<(n);++(i))
#define rep(i,n) reps(i,0,n)
#define rept(i,n) rep(i,(n)+1)
#define repst(i,s,n) reps(i,s,(n)+1)
#define reprt(i,n,t) for(int (i)=(n);(i)>=(t);--(i))
#define repr(i,n) reprt(i,n,0)
#define each(i,v) for(auto &(i):(v))
#define eachr(i,v) for(auto &(i)=(v).rbegin();(i)!=(v).rend();(i)++)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define tmax(x,y,z) max(x,max(y,z))
#define tmin(x,y,z) min(x,min(y,z))
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define ln '\n'
#define bln(i,n) (((i)==(n)-1)?'\n':' ')
#define dbg(x) cout<<#x" = "<<(x)<<ln<<flush
#define dbga(x,n) {cout<<#x" : ";for(int (i)=0;i<(n);++i){cout<<((x)[i])<<(i==((n)-1)?'\n':' ')<<flush;}}
#define zero(a) memset(a,0,sizeof(a))
#define unq(a) sort(all(a)),a.erase(unique(all(a)),a.end())

//typedef complex<double> P;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vector<int> > mat;

const ll inf = (ll)1e9+10;
const ll linf = (ll)1e18+10;
const ll mod = (ll)(1e9+7);
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
const double eps = 1e-10;

ll mop(ll a,ll b,ll m=mod) {ll r=1;a%=m;for(;b;b>>=1){if(b&1)r=r*a%m;a=a*a%m;}return r;}
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b) {return a/gcd(a,b)*b;}
bool ool(int x,int y,int h,int w) {return((x<0)||(h<=x)||(y<0)||(w<=y));}
bool deq(double a,double b) {return abs(a-b)<eps;}

struct oreno_initializer {
	oreno_initializer() {
		cin.tie(0);
		ios::sync_with_stdio(0);
	}
} oreno_initializer;



int n, m, q, a, b, c;

const int MAXV = 555;
class FordFulkerson {
private:
	struct edge {int to, cap, rev;};
	vector<edge> g[MAXV];
	bool used[MAXV];
	int flow;
public:
	void add_edge(int from, int to, int cap = 1) {
		g[from].push_back((edge){to, cap, (int)g[to].size()});
		g[to].push_back((edge){from, cap, (int)g[from].size()-1});
	}
	int dfs(int v, int t, int f) {
		if (v==t) return f;
		used[v] = true;
		for (int i = 0; i < g[v].size(); ++i) {
			edge &e = g[v][i];
			if (!used[e.to] && e.cap>0) {
				int d = dfs(e.to, t, min(f,e.cap));
				if (d>0) {
					e.cap -= d;
					g[e.to][e.rev].cap += d;
					return d;
				}
			}
		}
		return 0;
	}
	int getflow(int s, int t) {
		while (1) {
			memset(used,0,sizeof(used));
			int f = dfs(s,t,1<<30);
			if (f==0) return flow;
			flow += f;
		}
	}
	void del_edge(int from, int to) {
		int x, y;
		rep(i,g[from].size()) if (g[from][i].to==to) x = i;
		rep(i,g[to].size()) if (g[to][i].to==from) y = i;
		//cout << g[from][x].cap << ' ' << g[to][y].cap << endl;
		if (g[from][x].cap && g[to][y].cap) {
			g[from][x].cap = g[to][y].cap = 0;
			return;
		}
		if (g[to][y].cap==0) swap(from,to), swap(x,y);
		g[to][y].cap = 0;
		if (dfs(from,to,1)) return;
		if (flow) flow--;
		//memset(used,0,sizeof(used));
		//int f = dfs(from,to,1);
		//if (f) return;
		memset(used,0,sizeof(used));
		dfs(from,0,1);
		memset(used,0,sizeof(used));
		dfs(n-1,to,1);
	}
	void debug() {
		cout << "### DEBUG START ###" << endl;
		rep(i,10) each(j,g[i]) {
			cout << i << "->" << j.to << ' ' << j.cap << endl;
		}
		cout << "### DEBUG END ###" << endl << endl;
	}
};

FordFulkerson ff;

signed main() {
	cin >> n >> m >> q;
	rep(i,m) {
		cin >> a >> b;
		a--, b--;
		ff.add_edge(a,b);
	}
	while (q--) {
		cin >> c >> a >> b;
		a--, b--;
		if (c==1) ff.add_edge(a,b);
		else ff.del_edge(a,b);
		cout << ff.getflow(0,n-1) << endl;
		//ff.debug();
	}
}



Measured memory_bytes: 3800