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 MOD = 1e9 + 7;
const int SIZE = 2e5 + 10;
vector<pair<int, int> > e[SIZE], emp;
int N, L, R;
int NUM[SIZE];
int d[SIZE], dn;
int bfs[SIZE], sons[SIZE];
int used[SIZE], tt, tt2, father[SIZE];
vector<int> qq;
template <class T>
void maa(T& x, T y) {
  if (x < y) x = y;
}
template <class T>
void mii(T& x, T y) {
  if (x > y) x = y;
}
void build(int st) {
  bfs[0] = st;
  tt2--;
  used[st] = tt2;
  int i = 0, j = 1;
  for (; i < j; i++) {
    int x = bfs[i];
    sons[x] = 1;
    for (int k = 0; k < (((int)(e[x]).size())); ++k) {
      int y = e[x][k].first;
      if (used[y] == tt || used[y] == tt2) continue;
      father[y] = x;
      used[y] = tt2;
      bfs[j++] = y;
    }
  }
  int num = j;
  for (i = j - 1; i >= 0; i--) {
    int x = bfs[i];
    if (sons[x] * 2 >= num) {
      qq.push_back(x);
      used[x] = tt;
      for (int k = 0; k < (((int)(e[x]).size())); ++k) {
        int y = e[x][k].first;
        if (used[y] != tt) build(y);
      }
      return;
    }
    sons[father[x]] += sons[x];
  }
}
void init() {
  tt++;
  qq.clear();
  build(0);
}
int ans_id;
double ans_v;
double tmp_v;
void dfs9(int x, int v, int lt) {
  tmp_v += pow(v, 1.5) * NUM[x];
  for (int i = 0; i < (((int)(e[x]).size())); ++i) {
    int y = e[x][i].first;
    if (y == lt) continue;
    dfs9(y, v + e[x][i].second, x);
  }
}
void fresh(int x) {
  tmp_v = 0;
  dfs9(x, 0, x);
  if (tmp_v < ans_v) {
    ans_id = x;
    ans_v = tmp_v;
  }
}
double delta[SIZE];
int from;
void dfs5(int x, int lt, int v) {
  delta[from] += sqrt(v) * NUM[x];
  for (int i = 0; i < (((int)(e[x]).size())); ++i) {
    int y = e[x][i].first;
    if (y == lt) continue;
    dfs5(y, x, v + e[x][i].second);
  }
}
void dfs3(int x, int lt) {
  if (used[x] == tt) return;
  used[x] = tt;
  for (int i = 0; i < (((int)(e[x]).size())); ++i) {
    int y = e[x][i].first;
    if (y != lt) dfs3(y, x);
  }
}
bool Go() {
  tt++;
  for (int i = 0; i < (((int)(qq).size())); ++i) {
    int me = qq[i];
    if (used[me] == tt) continue;
    fresh(me);
    used[me] = tt;
    double sum = 0;
    for (int i = 0; i < (((int)(e[me]).size())); ++i) {
      from = e[me][i].first;
      delta[from] = 0;
      dfs5(from, me, e[me][i].second);
      sum += delta[from];
    }
    for (int i = 0; i < (((int)(e[me]).size())); ++i) {
      int y = e[me][i].first;
      if (delta[y] * 2 - sum < 1e-12) {
        dfs3(y, me);
      }
    }
  }
  return 0;
}
int main() {
  scanf("%d", &(N));
  dn = 0;
  for (int i = 0; i < (N); ++i) e[i] = emp;
  for (int i = 0; i < (N); ++i) scanf("%d", &(NUM[i]));
  for (int i = (1); i < (N); ++i) {
    int x, y, v;
    scanf("%d%d%d", &x, &y, &v);
    x--;
    y--;
    e[x].push_back(make_pair(y, v));
    e[y].push_back(make_pair(x, v));
  }
  init();
  ans_v = 1e100;
  Go();
  printf("%d %.9f\n", ans_id + 1, ans_v);
  return 0;
}
