#include <bits/stdc++.h>

#define ll long long
#define Nmax 1000005

using namespace std;

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser fin("episodul1.in");
OutParser fout("episodul1.out");

int M, N;
int t;
int T[Nmax];
int L[Nmax];
ll APM[Nmax];

int find(int node)
{
    if(node != T[node])
        T[node] = find(T[node]);
    return T[node];
}

void unite(int a, int b, int cost)
{
    if(L[a] < L[b])
        swap(a, b);
    T[b] = a;
    if(L[a] == L[b])
        L[a]++;
    APM[a] += APM[b] + cost;
}

void insertEdge(int x, int y, int c)
{
    int tx = find(x);
    int ty = find(y);
    if(tx != ty)
        unite(tx, ty, c);
}

int main()
{
    for(fin >> M; M; M--)
    {
        int t;
        fin >> t;
        if(t == 1)
        {
            ++N;
            T[N] = N;
            L[N] = 1;
            APM[N] = 0;
        }
        if(t == 2)
        {
            int x, y, c;
            fin >> x >> y >> c;
            insertEdge(x, y, c);
        }
        if(t == 3)
        {
            int x;
            fin >> x;
            fout << APM[find(x)] << "\n";
        }
    }
    return 0;
}