3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int _ = 2e5 + 7;
struct Edge {
  int end, upEd, w;
} Ed[_ << 1];
int head[_], cntEd, N, W[_];
void addEd(int a, int b, int c) {
  Ed[++cntEd] = (Edge){b, head[a], c};
  head[a] = cntEd;
}
long double mn;
int id, nsz, msz, rt;
bool vis[_];
void getsz(int x) {
  vis[x] = 1;
  ++nsz;
  for (int i = head[x]; i; i = Ed[i].upEd)
    if (!vis[Ed[i].end]) getsz(Ed[i].end);
  vis[x] = 0;
}
int getrt(int x) {
  vis[x] = 1;
  int mx = 0, sz = 1;
  for (int i = head[x]; i; i = Ed[i].upEd)
    if (!vis[Ed[i].end]) {
      int t = getrt(Ed[i].end);
      sz += t;
      mx = max(mx, t);
    }
  mx = max(mx, nsz - sz);
  if (msz > mx) {
    msz = mx;
    rt = x;
  }
  vis[x] = 0;
  return sz;
}
void calc(int x, int p, long double L, long double &ans, long double &dec) {
  ans += W[x] * pow(L, 1.5);
  dec += W[x] * sqrt(L);
  for (int i = head[x]; i; i = Ed[i].upEd)
    if (Ed[i].end != p) calc(Ed[i].end, x, L + Ed[i].w, ans, dec);
}
void solve(int x) {
  nsz = 0;
  msz = 1e9;
  getsz(x);
  getrt(x);
  x = rt;
  long double ans = 0, dec = 0;
  calc(x, 0, 0, ans, dec);
  vis[x] = 1;
  if (mn > ans) {
    mn = ans;
    id = x;
  }
  for (int i = head[x]; i; i = Ed[i].upEd)
    if (!vis[Ed[i].end]) {
      long double ans = 0, dec1 = 0;
      calc(Ed[i].end, x, Ed[i].w, ans, dec1);
      if (dec1 * 2 > dec) {
        solve(Ed[i].end);
        break;
      }
    }
}
int main() {
  ios::sync_with_stdio(0);
  cin >> N;
  for (int i = 1; i <= N; ++i) cin >> W[i];
  for (int i = 1; i < N; ++i) {
    int p, q, w;
    cin >> p >> q >> w;
    addEd(p, q, w);
    addEd(q, p, w);
  }
  mn = 1e60;
  solve(1);
  cout << id << ' ' << setprecision(10) << mn << endl;
  return 0;
}
